Sciweavers

1589 search results - page 275 / 318
» Multiple-Goal Heuristic Search
Sort
View
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
14 years 20 days ago
A genetic algorithm with exon shuffling crossover for hard bin packing problems
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
Philipp Rohlfshagen, John A. Bullinaria
GECCO
2007
Springer
213views Optimization» more  GECCO 2007»
14 years 20 days ago
Aspects of adaptation in natural and artificial evolution
This work addresses selected aspects of natural evolution, especially of the field of population genetics, that are considered to be meaningful for algorithmic further development...
Michael Affenzeller, Stefan Wagner 0002, Stephan M...
ACNS
2006
Springer
86views Cryptology» more  ACNS 2006»
14 years 16 days ago
Efficient Memory Bound Puzzles Using Pattern Databases
CPU bound client puzzles have been suggested as a defense mechanism against connection depletion attacks. However, the wide disparity in CPU speeds prevents such puzzles from being...
Sujata Doshi, Fabian Monrose, Aviel D. Rubin
CIKM
2006
Springer
14 years 16 days ago
Describing differences between databases
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
Heiko Müller, Johann Christoph Freytag, Ulf L...
CP
2006
Springer
14 years 16 days ago
A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
Matthew J. Streeter, Stephen F. Smith