Sciweavers

1639 search results - page 110 / 328
» Anytime Heuristic Search
Sort
View
91
Voted
INLG
2004
Springer
15 years 6 months ago
Reining in CCG Chart Realization
Abstract. We present a novel ensemble of six methods for improving the efficiency of chart realization. The methods are couched in the framework of Combinatory Categorial Grammar (...
Michael White
ATAL
2004
Springer
15 years 4 months ago
Generating Coalition Structures with Finite Bound from the Optimal Guarantees
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multiagent system...
Viet Dung Dang, Nicholas R. Jennings
120
Voted
AAAI
2008
15 years 3 months ago
Towards Faster Planning with Continuous Resources in Stochastic Domains
Agents often have to construct plans that obey resource limits for continuous resources whose consumption can only be characterized by probability distributions. While Markov Deci...
Janusz Marecki, Milind Tambe
109
Voted
AIPS
2003
15 years 2 months ago
A Framework for Planning in Continuous-time Stochastic Domains
We propose a framework for policy generation in continuoustime stochastic domains with concurrent actions and events of uncertain duration. We make no assumptions regarding the co...
Håkan L. S. Younes, David J. Musliner, Reid ...
81
Voted
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
15 years 6 months ago
Relativized NP Search Problems and Propositional Proof Systems
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
Josh Buresh-Oppenheim, Tsuyoshi Morioka