2157 search results - page 121 / 432 » Optimal Fast Hashing |
137
click to vote
DAC
1989
ACM
15 years 8 months ago
1989
ACM
We present a new 0 (n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our ...
133
Voted
ASPDAC
2007
ACM
15 years 8 months ago
2007
ACM
Many current integrated circuits designs, such as those released for the ISPD2005[14] placement contest, are extremely large and can contain a great deal of white space. These new...
117
click to vote
ASAP
2004
IEEE
15 years 8 months ago
2004
IEEE
In this paper, we present the design of a carry skip adder that achieves low power dissipation and high-performance operation. The carry skip adder's delay and power dissipat...
131
click to vote
EDOC
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper we have proposed a new route finding method for car navigation systems meanwhile, have utilized learning power and high speed of neural networks in our proposed meth...
137
Voted
DAGSTUHL
2008
15 years 6 months ago
2008
Existing selfverifying solvers for dense linear (interval-)systems in C-XSC provide high accuracy, but are rather slow. A new set of solvers is presented, which are a lot faster th...