10718 search results - page 540 / 2144 » On the Circuit Implementation Problem |
149
click to vote
PODC
2003
ACM
16 years 12 days ago
2003
ACM
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
208
click to vote
FPGA
2003
ACM
16 years 11 days ago
2003
ACM
In this paper, we present the first exact algorithm to solve the constrained I/O placement problem for FPGAs that support multiple I/O standards. We derive a compact integer line...
199
click to vote
DATE
2010
IEEE
16 years 7 days ago
2010
IEEE
—We present a new technique for statistical static timing analysis (SSTA) based on Markov chain Monte Carlo (MCMC), that allows fast and accurate estimation of the right-hand tai...
181
click to vote
VLSID
1999
IEEE
15 years 11 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...
248
click to vote
MAS
1998
Springer
15 years 11 months ago
1998
Springer
A key element of any mobile code based distributed system are the security mechanisms available to protect (a) the host against potentially hostile actions of a code fragment under...