1702 search results - page 205 / 341 » Using Nondeterminism to Design Efficient Deterministic Algor... |
152
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
We present an efficient technique for finding the mean and variance of the full-chip leakage of a candidate design, while considering logic-structures and both die-to-die and with...
167
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
161
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
124
click to vote
ICRA
2003
IEEE
15 years 11 months ago
2003
IEEE
― This paper describes a new docking system called Compliant-And-Self-Tightening (CAST) developed as an effective and efficient connector for joining and releasing modules of sel...
184
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approx...