111 search results - page 14 / 23 » The Hamiltonian p-Median Problem |
153
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
149
click to vote
IJAIT
2010
15 years 4 months ago
2010
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...
170
click to vote
FUN
2007
Springer
15 years 10 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
156
click to vote
JNS
2008
15 years 6 months ago
2008
The interaction of two charges moving in R3 in a magnetic field B can be formulated as a Hamiltonian system with six degrees of freedom. Assuming that the magnetic field is uniform...
171
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...