Sciweavers

1155 search results - page 124 / 231
» Continuous dynamic problem generators for evolutionary algor...
Sort
View
AAAI
1994
15 years 4 months ago
In Search of the Best Constraint Satisfaction Search
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
Daniel Frost, Rina Dechter
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
16 years 3 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 8 months ago
MeSwarm: memetic particle swarm optimization
In this paper, a novel variant of particle swarm optimization (PSO), named memetic particle swarm optimization algorithm (MeSwarm), is proposed for tackling the overshooting probl...
Bo-Fu Liu, Hung-Ming Chen, Jian-Hung Chen, Shiow-F...
ATAL
2010
Springer
14 years 10 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...
ESA
2004
Springer
127views Algorithms» more  ESA 2004»
15 years 8 months ago
Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of nearest...
Robert Elsässer, Burkhard Monien, Stefan Scha...