Sciweavers

125 search results - page 7 / 25
» Adaptive discretization on multidimensional continuous searc...
Sort
View
96
Voted
DEXA
2003
Springer
162views Database» more  DEXA 2003»
15 years 4 months ago
Dynamic Splitting Policies of the Adaptive 3DR-Tree for Indexing Continuously Moving Objects
Moving-objects databases need a spatio-temporal indexing scheme for moving objects to efficiently process queries over continuously changing locations of the objects. A simple exte...
Bonggi Jun, Bonghee Hong, Byunggu Yu
104
Voted
AHS
2006
IEEE
119views Hardware» more  AHS 2006»
15 years 5 months ago
Particle Swarm Optimization with Discrete Recombination: An Online Optimizer for Evolvable Hardware
Self-reconfigurable adaptive systems have the possibility of adapting their own hardware configuration. This feature provides enhanced performance and flexibility, reflected i...
Jorge Peña, Andres Upegui, Eduardo Sanchez
MEMETIC
2010
311views more  MEMETIC 2010»
14 years 6 months ago
Iterated local search with Powell's method: a memetic algorithm for continuous global optimization
In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization proces...
Oliver Kramer
ICTAI
2003
IEEE
15 years 4 months ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
David Bellot, Pierre Bessière
93
Voted
GECCO
2006
Springer
206views Optimization» more  GECCO 2006»
15 years 3 months ago
Adaptive discretization for probabilistic model building genetic algorithms
This paper proposes an adaptive discretization method, called Split-on-Demand (SoD), to enable the probabilistic model building genetic algorithm (PMBGA) to solve optimization pro...
Chao-Hong Chen, Wei-Nan Liu, Ying-Ping Chen