Sciweavers

62 search results - page 7 / 13
» A Hybrid of Inference and Local Search for Distributed Combi...
Sort
View
IJCAI
2007
13 years 8 months ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings
HEURISTICS
2002
146views more  HEURISTICS 2002»
13 years 7 months ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
AUSAI
2005
Springer
14 years 28 days ago
A Lagrangian Heuristic for Winner Determination Problem in Combinatorial Auctions
Abstract. We present a Lagrangian-based heuristic LAHA for the Winner Determination Problem in Combinatorial Auctions. The algorithm makes use of the market computing power by appl...
Andrew Lim, Jiqing Tang
JCC
2008
166views more  JCC 2008»
13 years 7 months ago
Reference energy extremal optimization: A stochastic search algorithm applied to computational protein design
: We adapt a combinatorial optimization algorithm, extremal optimization (EO), for the search problem in computational protein design. This algorithm takes advantage of the knowled...
Naigong Zhang, Chen Zeng
IJCIA
2008
68views more  IJCIA 2008»
13 years 7 months ago
A Hybrid Estimation of Distribution Algorithm for CDMA Cellular System Design
Abstract: While code division multiple access (CDMA) is becoming a promising cellular communication system, the design for a CDMA cellular system configuration has posed a practica...
Jianyong Sun, Qingfu Zhang, Jin Li, Xin Yao