2924 search results - page 227 / 585 » Lower Bounds in Distributed Computing |
129
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
159
click to vote
DAC
2003
ACM
16 years 4 months ago
2003
ACM
We present an algorithm that checks behavioral consistency between an ANSI-C program and a circuit given in Verilog using Bounded Model Checking. Both the circuit and the program ...
135
click to vote
DAC
1997
ACM
15 years 8 months ago
1997
ACM
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
156
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The transition from single-core to multi-core processors has made multi-threaded software an important subject in computer aided verification. Here, we describe and evaluate an ex...
244
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...