4524 search results - page 678 / 905 » The Complexity of Global Constraints |
157
click to vote
DAC
1996
ACM
15 years 11 months ago
1996
ACM
Iterative-improvement 2-way min-cut partitioning is an important phase in most circuit partitioning tools. Most iterative improvement techniques for circuit netlists like the Fidd...
285
click to vote
DAC
1994
ACM
15 years 11 months ago
1994
ACM
Today's high-performance single-chip CMOS microprocessors are the most complex and challenging chip designs ever implemented. To stay on the leading edge, Digital's micro...
192
click to vote
ECAI
1994
Springer
15 years 11 months ago
1994
Springer
For large problems the ATMS often becomes the main resource consumer in any reasoning system. We propose an architecture (the 2vATMS) that combines the advantages of two techniques...
181
click to vote
SIGGRAPH
1992
ACM
15 years 11 months ago
1992
ACM
We present a new radiosi[y algorithm for efficiently computing global solutions with respect to a constrained set of views. Radiosi ties of directly visible surfaces are computed ...
156
click to vote
PODC
2010
ACM
15 years 11 months ago
2010
ACM
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...