Sciweavers

14078 search results - page 86 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
120
Voted
COMGEO
1998
ACM
15 years 2 months ago
Computing fence designs for orienting parts
A common task in automated manufacturing processes is to orient parts prior to assembly. We consider sensorless orientation of a polygonal part by a sequence of fences. We show th...
Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H....
133
Voted
PPOPP
2009
ACM
16 years 3 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
117
Voted
SLIP
2006
ACM
15 years 8 months ago
Generation of design guarantees for interconnect matching
Manufacturable design requires matching of interconnects which have equal nominal dimensions. New design rules are projected to bring guarantee rules for interconnect matching. In...
Andrew B. Kahng, Rasit Onur Topaloglu
355
Voted
DAC
2012
ACM
13 years 5 months ago
On software design for stochastic processors
Much recent research [8, 6, 7] suggests significant power and energy benefits of relaxing correctness constraints in future processors. Such processors with relaxed constraints ...
Joseph Sloan, John Sartori, Rakesh Kumar
133
Voted
DAC
2003
ACM
16 years 3 months ago
Death, taxes and failing chips
In the way they cope with variability, present-day methodologies are onerous, pessimistic and risky, all at the same time! Dealing with variability is an increasingly important as...
Chandu Visweswariah