Sciweavers

3317 search results - page 266 / 664
» Strategies in Rigid-Variable Methods
Sort
View
CP
2008
Springer
15 years 8 months ago
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel,...
EVOW
2008
Springer
15 years 8 months ago
An Evolutionary Game-Theoretical Approach to Particle Swarm Optimisation
Abstract. This work merges ideas from two very different areas: Particle Swarm Optimisation and Evolutionary Game Theory. In particular, we are looking to integrate strategies from...
Cecilia Di Chio, Paolo Di Chio, Mario Giacobini
ECIR
2006
Springer
15 years 8 months ago
A Hybrid Approach to Index Maintenance in Dynamic Text Retrieval Systems
In-place and merge-based index maintenance are the two main competing strategies for on-line index construction in dynamic information retrieval systems based on inverted lists. Mo...
Stefan Büttcher, Charles L. A. Clarke
BNCOD
1997
111views Database» more  BNCOD 1997»
15 years 8 months ago
Improved and Optimized Partitioning Techniques in Database Query Processing
Abstract. In this paper we present two improvements to the partitioning process: 1) A new dynamic bu er management strategy is employed to increase the average block size of I/O-tr...
Kjell Bratbergsengen, Kjetil Nørvåg
GECCO
2008
Springer
157views Optimization» more  GECCO 2008»
15 years 7 months ago
Self-adaptive mutation rates in genetic algorithm for inverse design of cellular automata
Self-adaptation is used a lot in Evolutionary Strategies and with great success, yet for some reason it is not the mutation adaptation of choice for Genetic Algorithms. This poste...
Ron Breukelaar, Thomas Bäck