2944 search results - page 124 / 589 » Improving Bound Propagation |
ALGORITHMICA
2004
13 years 10 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
CDC
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract-- Autonomous underwater vehicles are flexible mobile platforms for ocean sampling and surveillance missions. However, navigation of these vehicles in unstructured, highly ...
CDC
2010
IEEE
13 years 5 months ago
2010
IEEE
We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose ...
SAT
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
IJCAI
2007
13 years 11 months ago
2007
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...