The DOI matches its OpenAlex record; 17 of the 17 references it cites were found in a registry or an index.
Using anytime algorithms in intelligent systems
Abstract
73-83
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Models of Bounded Rationality: Empirically Grounded Economic Reason
Simon, H. A. (1997) · The MIT Press eBooks · doi:10.7551/mitpress/4711.001.0001 · Cited by 4,205
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
(1986) · Journal of the Operational Research Society · doi:10.1057/jors.1986.93 · Cited by 1,679
An analysis of time-dependent planning
Dean, T., & Boddy, M. (1988) · National Conference on Artificial Intelligence · Cited by 789
Do the Right Thing: Studies in Limited Rationality
Russell, S., Wefald, E. H., Bobrow, D. G., Brady, M., & Davis, R. (1991) · The MIT Press eBooks · doi:10.7551/mitpress/2474.001.0001 · Cited by 655
Algorithms for scheduling imprecise computations
Liu, J. W. S., Lin, K.-Y., Shih, W.-K., Yu, A., Chung, J.-Y., & Zhao, W. (1991) · Computer · doi:10.1109/2.76287 · Cited by 524
Russell, S., & Wefald, E. (1991) · Artificial Intelligence · doi:10.1016/0004-3702(91)90015-c · Cited by 358
Reasoning about beliefs and actions under computational resource constraints
(1988) · International Journal of Approximate Reasoning · doi:10.1016/0888-613x(88)90148-x · Cited by 309
Solving time-dependent planning problems
Boddy, M., & Dean, T. (1989) · International Joint Conference on Artificial Intelligence · Cited by 292
Deliberation scheduling for problem solving in time-constrained environments
Boddy, M., & Dean, T. L. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90054-x · Cited by 240
Operational rationality through compilation of anytime algorithms
Shlomo Zilberstein, B. (1993) · doi:10.1609/aimag.v16i2.1136 · Cited by 185
Self-citationOptimal composition of real-time systems
Zilberstein, S., & Russell, S. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(94)00074-3 · Cited by 181
Russell, S., & Shlomo Zilberstein, B. (1991) · Cited by 155
Self-citationRATIONALITY AND ITS ROLES IN REASONING
Doyle, J. (1992) · Computational Intelligence · doi:10.1111/j.1467-8640.1992.tb00371.x · Cited by 143
Approximate Processing in Real-Time Problem Solving
Lesser, V., Pavlin, J., & Durfee, E. H. (1988) · doi:10.1609/aimag.v9i1.661 · Cited by 139
Anytime Sensing, Planning and Action: A Practical Model for Robot Control
Zilberstein, S., & Russell, S. (1993) · Cited by 117
Computation and action under bounded resources
Hovitz, E. J. (1991) · Cited by 105
A survey of research in deliberative real-time artificial intelligence
Garvey, A., & Lesser, V. (1994) · Real-Time Systems · doi:10.1007/bf01088630 · Cited by 98
Cited by
Computational Methods of Feature Selection
(2007) · Chapman & Hall/CRC eBooks · doi:10.1201/9781584888796 · Cited by 1,271
A survey of point-based POMDP solvers
Shani, G., Pineau, J., & Kaplow, R. (2013) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-012-9200-2 · Cited by 422
Artificial intelligence: foundations of computational agents
(2010) · Choice Reviews Online · doi:10.5860/choice.48-2130 · Cited by 415
Neo: a learned query optimizer
Marcus, R., Negi, P., Mao, H., Zhang, C., Alizadeh, M., Kraska, T., Papaemmanouil, O., & Tatbul, N. (2019) · Proceedings of the VLDB Endowment · doi:10.14778/3342263.3342644 · Cited by 389
Fairness-aware Learning through Regularization Approach
Kamishima, T., Akaho, S., & Sakuma, J. (2011) · 2011 IEEE 11th International Conference on Data Mining Workshops · doi:10.1109/icdmw.2011.83 · Cited by 371
Metadata
- Authors
- Shlomo Zilberstein, B.
- Published
- 1996-03-15
- Volume
- 17
- Issue
- 3
- Pages
- 73-83
- OpenAlex
- W2163316275
- Cited by
- 680
- References
- 17
- FWCI
- 13.46
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.