Sciweavers

11 search results - page 2 / 3
» Tractable Tree Convex Constraint Networks
Sort
View
IJCAI
2003
13 years 6 months ago
Consistency and Set Intersection
We propose a new framework to study properties of consistency in a Constraint Network from the perspective of properties of set intersection. Our framework comes with a proof sche...
Yuanlin Zhang, Roland H. C. Yap
CORR
2007
Springer
130views Education» more  CORR 2007»
13 years 4 months ago
Lagrangian Relaxation for MAP Estimation in Graphical Models
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
Jason K. Johnson, Dmitry M. Malioutov, Alan S. Wil...
COCOON
2007
Springer
13 years 11 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
IROS
2009
IEEE
185views Robotics» more  IROS 2009»
13 years 11 months ago
Scalable and convergent multi-robot passive and active sensing
— A major barrier preventing the wide employment of mobile networks of robots in tasks such as exploration, mapping, surveillance, and environmental monitoring is the lack of efï...
Elias B. Kosmatopoulos, Lefteris Doitsidis, Konsta...
CDC
2009
IEEE
155views Control Systems» more  CDC 2009»
13 years 8 months ago
Efficient and robust communication topologies for distributed decision making in networked systems
Distributed decision making in networked systems depends critically on the timely availability of critical fresh information. Performance of networked systems, from the perspective...
John S. Baras, Pedram Hovareshti