Sciweavers

78 search results - page 12 / 16
» Heavy-Tailed Distributions in Combinatorial Search
Sort
View
HEURISTICS
2008
124views more  HEURISTICS 2008»
13 years 8 months ago
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 8 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 2 months ago
A leader-based parallel cross entropy algorithm for MCP
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
Zhanhua Bai, Qiang Lv
JUCS
2008
139views more  JUCS 2008»
13 years 8 months ago
Parallel Strategies for Stochastic Evolution
: This paper discusses the parallelization of Stochastic Evolution (StocE) metaheuristic, for a distributed parallel environment. VLSI cell placement is used as an optimization pro...
Sadiq M. Sait, Khawar S. Khan, Mustafa Imran Ali
PPSN
2004
Springer
14 years 1 months ago
Multi-cellular Development: Is There Scalability and Robustness to Gain?
Evolving large phenotypes remains nowadays a problem due to the combinatorial explosion of the search space. Seeking better scalability and inspired by the development of biologica...
Daniel Roggen, Diego Federici