Sciweavers

440 search results - page 75 / 88
» Local Search Heuristics for the Multidimensional Assignment ...
Sort
View
ECAI
2008
Springer
13 years 9 months ago
Combining Domain-Independent Planning and HTN Planning: The Duet Planner
Abstract. Despite the recent advances in planning for classical domains, the question of how to use domain knowledge in planning is yet to be completely and clearly answered. Some ...
Alfonso Gerevini, Ugur Kuter, Dana S. Nau, Alessan...
JAIR
2008
145views more  JAIR 2008»
13 years 7 months ago
Communication-Based Decomposition Mechanisms for Decentralized MDPs
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
Claudia V. Goldman, Shlomo Zilberstein
EDBT
2008
ACM
166views Database» more  EDBT 2008»
14 years 7 months ago
A novel spectral coding in a large graph database
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
Lei Zou, Lei Chen 0002, Jeffrey Xu Yu, Yansheng Lu
AI
2005
Springer
13 years 7 months ago
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Katsutoshi Hirayama, Makoto Yokoo
ATAL
2009
Springer
14 years 2 months ago
Sensitivity analysis for distributed optimization with resource constraints
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...
Emma Bowring, Zhengyu Yin, Rob Zinkov, Milind Tamb...