335 search results - page 7 / 67 » Solving the Hamiltonian path problem with a light-based comp... |
ICCCN
2008
IEEE
14 years 1 months ago
2008
IEEE
—In mobile ad hoc networks, solving the standard problems encountered in fixed networks can be challenging because of the unpredictable motion of mobile nodes. Due to the lack o...
GECCO
2003
Springer
14 years 18 days ago
2003
Springer
We explore the advantages of DNA-like genomes for evolutionary computation in silico. Coupled with simulations of chemical reactions, these genomes offer greater efficiency, reliab...
TCS
2011
13 years 2 months ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
TCAD
2008
13 years 7 months ago
2008
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
AI
2005
Springer
13 years 7 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...