Sciweavers

6693 search results - page 23 / 1339
» On an anytime algorithm for control
Sort
View
CSCLP
2008
Springer
13 years 11 months ago
IDB-ADOPT: A Depth-First Search DCOP Algorithm
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...
William Yeoh, Ariel Felner, Sven Koenig
ATAL
2007
Springer
14 years 3 months ago
An equal excess negotiation algorithm for coalition formation
Coalition formation is an important form of interaction in multiagent systems. It enables the agents to satisfy tasks that they would otherwise be unable to perform, or would perf...
Hrishikesh J. Goradia, José M. Vidal
UAI
2003
13 years 10 months ago
Optimal Limited Contingency Planning
For a given problem, the optimal Markov policy over a finite horizon is a conditional plan containing a potentially large number of branches. However, there are applications wher...
Nicolas Meuleau, David E. Smith
JAIR
2007
112views more  JAIR 2007»
13 years 9 months ago
Cutset Sampling for Bayesian Networks
The paper presents a new sampling methodology for Bayesian networks that samples only a subset of variables and applies exact inference to the rest. Cutset sampling is a network s...
Bozhena Bidyuk, Rina Dechter
AAAI
2011
12 years 9 months ago
Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
Kalev Kask, Andrew Gelfand, Lars Otten, Rina Decht...