Sciweavers

48 search results - page 5 / 10
» Merkle Puzzles are Optimal
Sort
View
EVOW
2000
Springer
13 years 10 months ago
An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems
Ant Colony Optimization is an evolutionary method that has recently been applied to scheduling problems. We propose an ACO algorithm for the Single Machine Total Weighted Tardiness...
Daniel Merkle, Martin Middendorf
AAAI
2004
13 years 8 months ago
Compressing Pattern Databases
A pattern database is a heuristic function stored as a lookup table which stores the lengths of optimal solutions for instances of subproblems. All previous pattern databases had ...
Ariel Felner, Ram Meshulam, Robert C. Holte, Richa...
VC
2008
143views more  VC 2008»
13 years 6 months ago
Example-driven animation synthesis
We introduce an easy and intuitive approach to create animations by assembling existing animations. Using our system, the user needs only to simply scribble regions of interest and...
Yu-Shuen Wang, Tong-Yee Lee
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
13 years 11 months ago
Computational Complexity of Two-Dimensional Platform Games
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Michal Forisek
IPPS
2003
IEEE
13 years 12 months ago
A Genetic Approach to Planning in Heterogeneous Computing Environments
Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search met...
Han Yu, Dan C. Marinescu, Annie S. Wu, Howard Jay ...