184 search results - page 13 / 37 » Using FPGAs to solve the Hamiltonian cycle problem |
VLSID
1999
IEEE
15 years 4 months ago
1999
IEEE
In this paper we address the problem of detailed FPGA routing using Boolean formulation methods. In the context of FPGA routing where routing resources are fixed, Boolean formulat...
105
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
102
click to vote
FPL
2011
Springer
13 years 11 months ago
2011
Springer
—On-chip Physical Unclonable Functions (PUFs) are emerging as a powerful security primitive that can potentially solve several security problems. A PUF needs to be robust against...
ICCAD
1995
IEEE
15 years 3 months ago
1995
IEEE
In a typical design
ow, the design may be altered slightly several times after the initial design cycle according to minor changes in the design speci cation either as a result o...
109
click to vote
DAC
1994
ACM
15 years 3 months ago
1994
ACM
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...