Sciweavers

261 search results - page 24 / 53
» On Threshold BDDs and the Optimal Variable Ordering Problem
Sort
View
GPEM
2002
163views more  GPEM 2002»
13 years 7 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf
ICDE
2010
IEEE
184views Database» more  ICDE 2010»
14 years 1 days ago
On optimal anonymization for l+-diversity
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
Junqiang Liu, Ke Wang
EVOW
2009
Springer
14 years 2 months ago
A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse
We consider a real-world problem arising in a warehouse for spare parts. Items ordered by customers shall be collected and for this purpose our task is to determine efficient picku...
Matthias Prandtstetter, Günther R. Raidl, Tho...
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
14 years 1 months ago
Real-coded ECGA for economic dispatch
In this paper, we propose a new approach that consists of the extended compact genetic algorithm (ECGA) and split-ondemand (SoD), an adaptive discretization technique, to economic...
Chao-Hong Chen, Ying-Ping Chen
GECCO
2006
Springer
190views Optimization» more  GECCO 2006»
13 years 11 months ago
Effective genetic approach for optimizing advanced planning and scheduling in flexible manufacturing system
In this paper, a novel approach for designing chromosome has been proposed to improve the effectiveness, which called multistage operation-based genetic algorithm (moGA). The obje...
Haipeng Zhang, Mitsuo Gen