Sciweavers

48 search results - page 3 / 10
» Merkle Puzzles are Optimal
Sort
View
GECCO
2009
Springer
101views Optimization» more  GECCO 2009»
13 years 11 months ago
GP-rush: using genetic programming to evolve solvers for the rush hour puzzle
Ami Hauptman, Achiya Elyasaf, Moshe Sipper, Assaf ...
HM
2007
Springer
120views Optimization» more  HM 2007»
14 years 23 days ago
On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case
Sudoku is a notorious logic-based puzzle that is popular with puzzle enthusiasts the world over. From a computational perspective, Sudoku is also a problem that belongs to the set ...
Rhydian Lewis
GECCO
2007
Springer
262views Optimization» more  GECCO 2007»
14 years 23 days ago
Geometric particle swarm optimization for the sudoku puzzle
Geometric particle swarm optimization (GPSO) is a recently introduced generalization of traditional particle swarm optimization (PSO) that applies to all combinatorial spaces. The...
Alberto Moraglio, Julian Togelius
VLSID
2002
IEEE
116views VLSI» more  VLSID 2002»
14 years 7 months ago
Prioritized Prime Implicant Patterns Puzzle for Novel Logic Synthesis and Optimization
Compare CMOS Logic with Pass-Transistor Logic, a question was raised in our mind: "Does any rule exist that contains all good?" This paper reveals novel logic synthesis ...
Kuo-Hsing Cheng, Shun-Wen Cheng
SOFSEM
2007
Springer
14 years 21 days ago
On Optimal Solutions for the Bottleneck Tower of Hanoi Problem
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...
Yefim Dinitz, Shay Solomon