Sciweavers

402 search results - page 24 / 81
» Constant-Time Approximation Algorithms via Local Improvement...
Sort
View
GECCO
2010
Springer
197views Optimization» more  GECCO 2010»
13 years 11 months ago
Niching the CMA-ES via nearest-better clustering
We investigate how a niching based evolutionary algorithm fares on the BBOB function test set, knowing that most problems are not very well suited to this algorithm class. However...
Mike Preuss
SIAMCOMP
2008
124views more  SIAMCOMP 2008»
13 years 7 months ago
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, Asaf Levin, David P. Williamson
ESWA
2008
162views more  ESWA 2008»
13 years 7 months ago
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
Der-Fang Shiau, Shu-Chen Cheng, Yueh-Min Huang
DASFAA
2008
IEEE
120views Database» more  DASFAA 2008»
14 years 2 months ago
Knowledge Transferring Via Implicit Link Analysis
In this paper, we design a local classification algorithm using implicit link analysis, considering the situation that the labeled and unlabeled data are drawn from two different ...
Xiao Ling, Wenyuan Dai, Gui-Rong Xue, Yong Yu
ATAL
2010
Springer
13 years 8 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...