1702 search results - page 205 / 341 » Using Nondeterminism to Design Efficient Deterministic Algor... |
DAC
2007
ACM
14 years 11 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...
COCO
2010
Springer
14 years 2 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...
DAC
2006
ACM
14 years 11 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...
ICRA
2003
IEEE
14 years 4 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...
CIKM
2006
Springer
14 years 2 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...