3820 search results - page 598 / 764 » Bounded Model Debugging |
87
Voted
ICCAD
2000
IEEE
15 years 7 months ago
2000
IEEE
To implement high-performance global interconnect without impacting the performance of existing blocks, the use of buffer blocks is increasingly popular in structured-custom and b...
116
click to vote
COMPGEOM
2007
ACM
15 years 6 months ago
2007
ACM
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
126
click to vote
COLT
2006
Springer
15 years 6 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
120
Voted
DNA
2006
Springer
15 years 6 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
132
Voted
SWAT
2000
Springer
15 years 6 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...