Sciweavers

600 search results - page 17 / 120
» Solving Distributed Constraint Optimization Problems Using L...
Sort
View
103
Voted
AGP
1999
IEEE
15 years 3 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
15 years 11 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
AAAI
2008
15 years 1 months ago
Anytime Local Search for Distributed Constraint Optimization
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small prob...
Roie Zivan
ECAI
2008
Springer
15 years 20 days ago
Dynamic Backtracking for Distributed Constraint Optimization
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...
Redouane Ezzahir, Christian Bessiere, Imade Benela...
GLOBECOM
2007
IEEE
15 years 5 months ago
Distributed Maximum Lifetime Routing in Wireless Sensor Networks Based on Regularization
— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...
Vahid Shah-Mansouri, Vincent W. S. Wong