Sciweavers

189 search results - page 13 / 38
» Solving Distributed Constraint Optimization Problems Using C...
Sort
View
ATAL
2006
Springer
13 years 11 months ago
Distributed Lagrangean relaxation protocol for the generalized mutual assignment problem
Abstract. The generalized assignment problem (GAP) is a typical NP-hard problem and has been studied for many years mainly in the operations research community. The goal of the GAP...
Katsutoshi Hirayama
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
11 years 10 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
CEC
2010
IEEE
12 years 11 months ago
Co-evolutionary search path planning under constrained information-sharing for a cooperative unmanned aerial vehicle team
—Mobile cooperative sensor networks are increasingly used for surveillance and reconnaissance tasks to support domain picture compilation. However, efficient distributed informat...
Jean Berger, Jens Happe
ATAL
2010
Springer
13 years 7 months ago
Local search for distributed asymmetric optimization
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...
Alon Grubshtein, Roie Zivan, Tal Grinshpoun, Amnon...
ENTCS
2007
190views more  ENTCS 2007»
13 years 7 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...