184 search results - page 5 / 37 » Using FPGAs to solve the Hamiltonian cycle problem |
100
Voted
ICNC
2005
Springer
15 years 3 months ago
2005
Springer
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
DSVIS
2005
Springer
15 years 3 months ago
2005
Springer
The mapping problem has been defined as the way to map models involved throughout the development life cycle of user interfaces. Model-based design of user interfaces has followed ...
FPL
2003
Springer
15 years 2 months ago
2003
Springer
Local search methods such as WSAT have proven to be successful for solving SAT problems. In this paper, we propose two host-FPGA (Field Programmable Gate Array) co-implementations,...
ISAAC
2007
Springer
15 years 3 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
82
Voted
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
The problem of finding one-dimensional structures in images and videos can be formulated as a problem of searching for cycles in graphs. In [11], an untangling-cycle cost functio...