Sciweavers

980 search results - page 65 / 196
» Decentralized Constraint Satisfaction
Sort
View
CP
2006
Springer
14 years 24 days ago
Randomization in Constraint Programming for Airline Planning
Abstract. We extend the common depth-first backtrack search for constraint satisfaction problems with randomized variable and value selection. The resulting methods are applied to ...
Lars Otten, Mattias Grönkvist, Devdatt P. Dub...
LICS
2012
IEEE
11 years 11 months ago
Near Unanimity Constraints Have Bounded Pathwidth Duality
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
Libor Barto, Marcin Kozik, Ross Willard
CDC
2009
IEEE
115views Control Systems» more  CDC 2009»
13 years 6 months ago
Reduction of decentralized control problems to tractable representations
For decentralized control problems with quadratically invariant information constraints, the optimal controller may be found efficiently. In this paper, we show that there are sys...
Laurent Lessard, Sanjay Lall
AAAI
2000
13 years 10 months ago
Asynchronous Search with Aggregations
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Falt...
AIMSA
2008
Springer
13 years 11 months ago
DynABT: Dynamic Asynchronous Backtracking for Dynamic DisCSPs
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
Bayo Omomowo, Inés Arana, Hatem Ahriz