366 search results - page 17 / 74 » Agent Compromises in Distributed Problem Solving |
FLAIRS
2008
13 years 10 months ago
2008
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed t...
AAAI
1997
13 years 9 months ago
1997
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...
AAAI
1990
13 years 9 months ago
1990
A case-based reasoner can frequently benefit from using pieces of multiple previous cases in the course of solving a single problem. In our model, case pieces, called snippets, ar...
AAAI
2007
13 years 10 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
We consider an agent-target assignment problem in an unknown environment modeled as an undirected graph. Agents do not know this graph or the locations of the targets on it. Howeve...