184 search results - page 4 / 37 » Using FPGAs to solve the Hamiltonian cycle problem |
195
click to vote
GECCO
2011
Springer
14 years 1 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
FPL
2006
Springer
15 years 1 months ago
2006
Springer
This work shows a modular architecture based on FPGA's to solve the eigenvalue problem according to the Jacobi method. This method is able to solve the eigenvalues and eigenv...
DM
1998
14 years 9 months ago
1998
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M b...
107
Voted
NMA
2010
14 years 7 months ago
2010
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathemat...
FCCM
2009
IEEE
15 years 1 months ago
2009
IEEE
This paper proposes a high performance least square solver on FPGAs using the Cholesky decomposition method. Our design can be realized by iteratively adopting a single triangular...