Sciweavers

48 search results - page 6 / 10
» Merkle Puzzles are Optimal
Sort
View
GPEM
2002
163views more  GPEM 2002»
13 years 6 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
TEC
2002
152views more  TEC 2002»
13 years 6 months ago
Ant colony optimization for resource-constrained project scheduling
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...
Daniel Merkle, Martin Middendorf, Hartmut Schmeck
ECAL
2007
Springer
14 years 26 days ago
The Role of Collective Reproduction in Evolution
To look for an answer to the puzzle of why complexity may increase, this paper looks to the major evolutionary transitions – a recurring pattern where individuals give up their r...
John Bryden
CCCG
2003
13 years 8 months ago
Curves of width one and the river shore problem
We consider the problem of finding the shortest curve in the plane that has unit width. This problem was first posed as the “river shore” puzzle by Ogilvy (1972) and is rela...
Timothy M. Chan, Alexander Golynski, Alejandro L&o...
JAIR
2007
107views more  JAIR 2007»
13 years 6 months ago
Compressed Pattern Databases
A pattern database (PDB) is a heuristic function implemented as a lookup table that stores the lengths of optimal solutions for subproblem instances. Standard PDBs have a distinct...
Ariel Felner, Richard E. Korf, Ram Meshulam, Rober...