569 search results - page 67 / 114 » An Efficient Algorithm for Solving Dynamic Complex DCOP Prob... |
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
ICTAI
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
JAIR
2010
13 years 6 months ago
2010
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all cod...
CAV
2001
Springer
14 years 4 days ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...