38 search results - page 3 / 8 » A Light-Based Device for Solving the Hamiltonian Path Proble... |
ICCCN
2008
IEEE
13 years 11 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...
DNA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Gene assembly in ciliates is an impressive computational process. Ciliates have a unique way of storing their genetic information in two fundamentally different forms wi...
DAM
1999
13 years 5 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
DAC
2007
ACM
14 years 6 months ago
2007
ACM
In this paper, we propose TROY, the first track router with yield-driven wire planning to optimize yield loss due to random defects. As the probability of failure (POF) computed f...
EOR
2006
13 years 5 months ago
2006
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...