$\require{mediawiki-texvc}$

연합인증

연합인증 가입 기관의 연구자들은 소속기관의 인증정보(ID와 암호)를 이용해 다른 대학, 연구기관, 서비스 공급자의 다양한 온라인 자원과 연구 데이터를 이용할 수 있습니다.

이는 여행자가 자국에서 발행 받은 여권으로 세계 각국을 자유롭게 여행할 수 있는 것과 같습니다.

연합인증으로 이용이 가능한 서비스는 NTIS, DataON, Edison, Kafe, Webinar 등이 있습니다.

한번의 인증절차만으로 연합인증 가입 서비스에 추가 로그인 없이 이용이 가능합니다.

다만, 연합인증을 위해서는 최초 1회만 인증 절차가 필요합니다. (회원이 아닐 경우 회원 가입이 필요합니다.)

연합인증 절차는 다음과 같습니다.

최초이용시에는
ScienceON에 로그인 → 연합인증 서비스 접속 → 로그인 (본인 확인 또는 회원가입) → 서비스 이용

그 이후에는
ScienceON 로그인 → 연합인증 서비스 접속 → 서비스 이용

연합인증을 활용하시면 KISTI가 제공하는 다양한 서비스를 편리하게 이용하실 수 있습니다.

[해외논문] Iterative state-space reduction for flexible computation 원문보기

Artificial intelligence, v.126 no.1/2, 2001년, pp.109 - 138  

Zhang, Weixiong (Department of Computer Science, Washington University, St. Louis, MO 63130-4899, USA)

Abstract AI-Helper 아이콘AI-Helper

AbstractFlexible computation is a general framework for decision making under limited computational resources. It enables an agent to allocate limited computational resources to maximize its overall performance or utility. In this paper, we present a strategy for flexible computation, which we call ...

주제어

참고문헌 (52)

  1. Balas 361 1985 The Traveling Salesman Problem Branch and bound methods 

  2. Bisiani 1467 1992 Encyclopedia of Artificial Intelligence Search, beam 

  3. Artificial Intelligence Boddy Vol. 67 245 1994 10.1016/0004-3702(94)90054-X Deliberation scheduling for problem solving in time-constrained environments 

  4. Management Science Carpaneto Vol. 26 736 1980 10.1287/mnsc.26.7.736 Some new branching and bounding criteria for the asymmetric traveling salesman problem 

  5. Cheeseman 331 1991 Proc. IJCAI-91, Sydney, Australia Where the really hard problems are 

  6. Artificial Intelligence Dagum Vol. 60 141 1993 10.1016/0004-3702(93)90036-B Approximating probabilistic inference in bayesian belief networks is NP-hard 

  7. J. ACM Davis Vol. 7 201 1960 10.1145/321033.321034 A computing procedure for quantification theory 

  8. Dean 49 1988 Proc. AAAI-88, St. Paul, MN An analysis of time-dependent planning 

  9. Artificial Intelligence Dietterich Vol. 16 257 1981 10.1016/0004-3702(81)90002-3 Inductive learning of structural descriptions: Evaluation criteria and comparative review of selected methods 

  10. Fox 1983 Constraint directed search: A case study of job-shop scheduling, Ph.D. Thesis 

  11. Artificial Intelligence Freuder Vol. 58 21 1992 10.1016/0004-3702(92)90004-H Partial constraint satisfaction 

  12. Garey 1979 Computers and Intractability: A Guide to the Theory of NP-Completeness 

  13. Artificial Intelligence Ginsberg Vol. 55 367 1992 10.1016/0004-3702(92)90059-7 Iterative broadening 

  14. Hansen 1997 Anytime heuristic search: First results 

  15. Harris 1963 The Theory of Branching Processes 

  16. Mathematical Programming Held Vol. 1 6 1971 10.1007/BF01584070 The traveling salesman problem and minimum spanning trees: Part II 

  17. 1996 Proceedings of the AAAI Fall Symposium on Flexible Computation in Intelligent Systems: Results, Issues and Opportunities, Cambridge, MA 

  18. Horvitz 1987 Proc. 3rd Workshop on Uncertainty in Artificial Intelligence Reasoning about beliefs and actions under computational resource constraints 

  19. Zeitschrift fur Operations Research Ibaraki Vol. 27 177 1983 Using branch-and-bound algorithms to obtain suboptimal solutions 

  20. Johnson 341 1996 Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms Asymptotic experimental analysis for the Held-Karp Traveling Salesman bound 

  21. Artificial Intelligence Karp Vol. 21 99 1983 10.1016/S0004-3702(83)80006-X Searching for an optimal path in a tree with random costs 

  22. Artificial Intelligence Korf Vol. 27 97 1985 10.1016/0004-3702(85)90084-0 Depth-first iterative-deepening: An optimal admissible tree search 

  23. Artificial Intelligence Korf Vol. 42 189 1990 10.1016/0004-3702(90)90054-4 Real-time heuristic search 

  24. Korf 1994 Proc. AAAI 1994 Workshop on Experimental Evaluation of Reasoning and Search Methods, Seattle, WA Incremental random search trees 

  25. Langley 145 1992 Proc. 1st International Conference on AI Planning Systems, College Park, MD Systematic and nonsystematic search strategies 

  26. Lawler 1985 The Traveling Salesman Problem 

  27. Lee 1988 Large-vocabulary speaker-dependent continuous recognition: The sphinx system, Ph.D. Thesis 

  28. Ann. Discrete Math. Martello Vol. 31 259 1987 Linear assignment problems 

  29. McDiarmid 249 1990 Disorder in Physical Systems Probabilistic analysis of tree search 

  30. McDiarmid 172 1991 Proc. IJCAI-91, Sydney, Australia An expected-cost analysis of backtracking and non-backtracking algorithms 

  31. Mitchell 459 1992 Proc. AAAI-92, San Jose, CA Hard and easy distributions of SAT problems 

  32. Motwani 1992 Lecture notes on approximation algorithms 

  33. Muscettola 1989 Generating space telescope observation schedules 

  34. Papadimitriou 1982 Combinatorial Optimization: Algorithms and Complexity 

  35. Ann. Math. Artificial Intelligence Patrick Vol. 5 265 1992 10.1007/BF01543478 An upper bound on the complexity of iterative-deepening-A? 

  36. Artificial Intelligence Pemberton Vol. 81 297 1996 10.1016/0004-3702(95)00057-7 Epsilon-transformation: Exploiting phase transitions to solve combinatorial optimization problems 

  37. 1995 Proceedings of the AAAI Fall Symposium on Rational Agency, Cambridge, MA 

  38. 1995 Proceedings of the IJCAI-95 Workshop on Anytime Algorithms and Deliberation Scheduling, Montreal, Canada 

  39. Provost 769 1993 Proc. AAAI-93, Washington, DC Iterative weakening: Optimal and near-optimal policies for the selection of search bias 

  40. Rubin 1978 The ARGOS image understanding system, Ph.D. Thesis 

  41. Russell 1991 Do the Right Thing: Studies in Limited Rationality 

  42. European J. Oper. Res. Volgenant Vol. 9 83 1982 10.1016/0377-2217(82)90015-7 A branch and bound algorithm for the symmetric Traveling Salesman Problem based on the 1-tree relaxation 

  43. Winston 1992 Artificial Intelligence 

  44. Zhang 160 1993 Proc. AAAI 1993 Spring Symposium on AI and NP-Hard Problems, Stanford, CA Truncated branch-and-bound: A case study on the asymmetric TSP 

  45. Zhang 425 1998 Proc. AAAI-98, Madison, WI Complete anytime beam search 

  46. Zhang 531 1998 Proc. 14th Annual Conference on Uncertainty in Artificial Intelligence (UAI-98), Madison, WI Flexible and approximate computation through state-space reduction 

  47. Zhang 148 1999 Proc. AAAI 1999 Spring Symposium on Search Techniques for Problem Solving under Uncertainty and Incomplete Information, Stanford, CA Truncated and anytime depth-first branch-and-bound: A case study on the asymmetric Traveling Salesman Problem 

  48. Zhang 545 1992 Proc. AAAI-92, San Jose, CA An average-case analysis of branch-and-bound with applications: Summary of results 

  49. Zhang 769 1993 Proc. AAAI-93, Washington, DC Depth-first vs. best-first search: New results 

  50. Artificial Intelligence Zhang Vol. 79 241 1995 10.1016/0004-3702(94)00047-6 Performance of linear-space search algorithms 

  51. Zhang 895 1994 Proc. AAAI-94, Seattle, WA Epsilon-transformation: Exploiting phase transitions to solve combinatorial optimization problems-Initial results 

  52. Artificial Intelligence Zilberstein Vol. 82 181 1996 10.1016/0004-3702(94)00074-3 Optimal composition of real-time systems 

관련 콘텐츠

오픈액세스(OA) 유형

BRONZE

출판사/학술단체 등이 한시적으로 특별한 프로모션 또는 일정기간 경과 후 접근을 허용하여, 출판사/학술단체 등의 사이트에서 이용 가능한 논문

저작권 관리 안내
섹션별 컨텐츠 바로가기

AI-Helper ※ AI-Helper는 오픈소스 모델을 사용합니다.

AI-Helper 아이콘
AI-Helper
안녕하세요, AI-Helper입니다. 좌측 "선택된 텍스트"에서 텍스트를 선택하여 요약, 번역, 용어설명을 실행하세요.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.

선택된 텍스트

맨위로