Sciweavers

1844 search results - page 316 / 369
» Exploiting the Structure of Distributed Constraint Optimizat...
Sort
View
JAIR
2008
110views more  JAIR 2008»
14 years 11 months ago
Completeness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
TMC
2008
146views more  TMC 2008»
14 years 11 months ago
General Network Lifetime and Cost Models for Evaluating Sensor Network Deployment Strategies
In multihop wireless sensor networks that are often characterized by many-to-one (convergecast) traffic patterns, problems related to energy imbalance among sensors often appear. S...
Zhao Cheng, Mark A. Perillo, Wendi B. Heinzelman
ICASSP
2011
IEEE
14 years 3 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
GECCO
2007
Springer
437views Optimization» more  GECCO 2007»
15 years 5 months ago
A gestalt genetic algorithm: less details for better search
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
Christophe Philemotte, Hugues Bersini
AAAI
2000
15 years 18 days ago
Decision Making under Uncertainty: Operations Research Meets AI (Again)
Models for sequential decision making under uncertainty (e.g., Markov decision processes,or MDPs) have beenstudied in operations research for decades. The recent incorporation of ...
Craig Boutilier