388 search results - page 53 / 78 » Discrete Hamilton-Jacobi theory and discrete optimal control |
COMPGEOM
2003
ACM
14 years 1 months ago
2003
ACM
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
GLVLSI
2002
IEEE
14 years 1 months ago
2002
IEEE
Spectral techniques have found many applications in computeraided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coeffici...
MICCAI
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, we introduce a novel approach to bridge the gap between the landmark-based and the iconic-based voxel-wise registration methods. The registration problem is formulat...
TALG
2008
13 years 8 months ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
GECCO
2006
Springer
14 years 9 days ago
2006
Springer
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...