Регистрация | Вход в службу | FAQ      [?] 

Ключевое слово anytime-algorithms [21 articles]

Recent papers classified by the tag anytime-algorithms.
  • Principles and applications of continual computation
    Artificial Intelligence, Vol. 126, No. 1-2. (2001), pp. 159-196.
    by Eric Horvitz
    posted to bounded-rationality continual-computation anytime-algorithms performance-modeling by gagliol on 2006-08-22 16:46:39 as **
  • Optimal Schedules for Parallelizing Anytime Algorithms
    (2001), pp. 49-56.
    by Lev Finkelstein, Shaul Markovitch, Ehud Rivlin
    posted to parallel-computing algorithm-portfolios algorithm-selection anytime-algorithms by gagliol on 2007-07-06 17:14:27 as **
  • Optimal schedules for monitoring anytime algorithms
    Artificial Intelligence, Vol. 126, No. 1-2. (2001), pp. 63-108.
    by Lev Finkelstein, Shaul Markovitch
    posted to anytime-algorithms by gagliol on 2007-07-06 16:55:42 as read
  • Nonsystematic Backtracking Search
    (1995)
    by William D Harvey
    posted to satisfiability parallel-computing algorithm-portfolios algorithm-selection computational-complexity anytime-algorithms backtracking-search constraint-satisfaction randomized-algorithms by gagliol on 2007-07-06 15:34:36 as **
  • Decision-Theoretic Planning: Structural Assumptions and Computational Leverage
    J. Artif. Intell. Res. (JAIR), Vol. 11 (1999), pp. 1-94.
    by Craig Boutilier, Thomas Dean, Steve Hanks
    posted to planning anytime-algorithms by gagliol on 2007-12-13 17:48:42 as ****
  • An Analysis of Time-Dependent Planning
    (1988), pp. 49-54.
    by Thomas Dean, Mark S Boddy
    edited by Tom M Mitchell, Reid G Smith
    posted to planning printed anytime-algorithms by gagliol on 2007-12-13 17:41:38 as ***
  • Provably bounded optimal agents
    (~FebruarySeptember--~March 1993), pp. 338-344.
    by SJ Russell, D Subramanian, R Parr
    edited by Ruzena Bajcsy
    posted to algorithm-selection anytime-algorithms by gagliol on 2007-12-18 15:24:18 as **
  • Reflection and Action Under Scarce Resources: Theoretical Principles and Empirical Study
    (1989), pp. 1121-1127.
    by EJ Horvitz, GF Cooper, DE Heckerman
    posted to anytime-algorithms time-dependent-planning time-quality-trade-off by gagliol on 2007-12-18 17:37:39 as **
  • Composing Real-Time Systems
    (1991), pp. 212-217.
    by Stuart J Russell, Shlomo Zilberstein
    posted to planning anytime-algorithms by gagliol on 2007-12-14 13:47:36 as **
  • Dynamic Composition of Information Retrieval Techniques
    Journal of Intelligent Information Systems, Vol. 23, No. 1., 67.
    by A Arnt, S Zilberstein, J Allan, M Mouaddib
    posted to bounded-rationality anytime-algorithms by gagliol on 2006-08-22 15:51:09 as **
  • Knowledge-Based Anytime Computation
    (1995), pp. 775-783.
    by Abdel I Mouaddib, Shlomo Zilberstein
    posted to algorithm-selection anytime-algorithms by gagliol on 2007-12-18 15:22:31 as **
  • Optimal Sequencing of Contract Algorithms
    by Shlomo Zilberstein, Fran\ccois Charpillet, Philippe Chassaing
    posted to contracts anytime-algorithms by gagliol on 2007-12-13 16:41:31 as ****
  • Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Shared Resources
    Journal of Artificial Intelligence Research, Vol. 19 (2003), pp. 73-138.
    by Lev Finkelstein, Shaul Markovitch, Ehud Rivlin
    posted to parallel-computing algorithm-portfolios algorithm-selection anytime-algorithms runtime-distributions by gagliol on 2007-07-06 15:04:41 as ****
  • Reasoning about Beliefs and Actions Under Computational Resource Constraints
    (1990), pp. 301-324.
    by Eric J Horvitz
    edited by M Henrion, RD Shachter, LN Kanal, JF Lemmer
    posted to anytime-algorithms time-dependent-planning time-quality-trade-off by gagliol on 2007-12-18 17:36:01 as **
  • A Decision-Theoretic Approach to Planning, Perception, and Control
    IEEE Expert, Vol. 7, No. 4. (1992), pp. 58-65.
    by Kenneth Basye, Thomas Dean, Jak Kirman, Moises Lejter
    posted to ai planning printed anytime-algorithms decision-theory by gagliol on 2007-12-13 18:08:28 as **
  • Bounded Conditioning: Flexible Inference for Decisions Under Scarce Resources
    (1989), pp. 182-193.
    by Eric J Horvitz, Jacques H Suermondt, Gregory F Cooper
    posted to gagliolo-phd printed anytime-algorithms time-quality-trade-off by gagliol on 2007-12-20 10:24:46 as **
  • Real-Time Problem-Solving with Contract Algorithms
    (1999), pp. 1008-1015.
    by Shlomo Zilberstein, Francois Charpillet, Philippe Chassaing
    posted to ai contracts anytime-algorithms by gagliol on 2007-12-13 16:40:47 as ****
  • Anytime Heuristic Search: First Results
    No. UM-CS-1997-050. (, 1997)
    by EA Hansen, S Zilberstein, VA Danilchenko
    posted to anytime-algorithms by gagliol on 2007-12-18 15:19:57 as **
  • Planning under Time Constraints in Stochastic Domains
    Artif. Intell., Vol. 76, No. 1-2. (1995), pp. 35-74.
    by Thomas Dean, Leslie P Kaelbling, Jak Kirman, Ann E Nicholson
    posted to planning printed anytime-algorithms by gagliol on 2007-12-13 18:02:31 as ****
  • Scheduling contract algorithms on multiple processors
    (2002)
    by D Bernstein, T Perkins, S Zilberstein, L Finkelstein
    posted to ai contracts scheduling anytime-algorithms parallel-computing by gagliol on 2007-12-13 16:38:16 as ****
  • A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
    Algorithmica, Vol. 16, No. 4/5. (1996), pp. 543-547.
    by Helmut Alt, Leonidas J Guibas, Kurt Mehlhorn, Richard M Karp, Avi Wigderson
    posted to bibtex-import-wt restart anytime-algorithms by gagliol on 2006-08-21 17:56:12 as ** along with 1 person and 2 groups camu Crypto Randomness
    • Вы можете ссылаться на эту страницу по адресу: http://www.citeulike.org/tag/anytime-algorithms

    RIS BibTeX RSS
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.