Sciweavers

119 search results - page 19 / 24
» Domain Independent Approaches for Finding Diverse Plans
Sort
View
AIPS
2010
13 years 7 months ago
Iterative Learning of Weighted Rule Sets for Greedy Search
Greedy search is commonly used in an attempt to generate solutions quickly at the expense of completeness and optimality. In this work, we consider learning sets of weighted actio...
Yuehua Xu, Alan Fern, Sung Wook Yoon
JAIR
2008
148views more  JAIR 2008»
13 years 7 months ago
Learning Partially Observable Deterministic Action Models
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
Eyal Amir, Allen Chang
SEMWEB
2004
Springer
14 years 25 days ago
Dynamic Agent Composition from Semantic Web Services
Abstract. The shift from Web pages to Web services enables programmatic access to the near limitless information on the World Wide Web. Autonomous agents should generate concise an...
Michael Czajkowski, Anna L. Buczak, Martin O. Hofm...
ATAL
2010
Springer
13 years 7 months ago
Using answer set programming to model multi-agent scenarios involving agents' knowledge about other's knowledge
One of the most challenging aspects of reasoning, planning, and acting in a multi-agent domain is reasoning about what the agents know about the knowledge of their fellows, and to...
Chitta Baral, Gregory Gelfond, Tran Cao Son, Enric...
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
14 years 7 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys