3055 search results - page 113 / 611 » Randomized Search Trees |
119
Voted
AAAI
2008
15 years 4 months ago
2008
The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain "hidden structure" in real-world instances. W...
124
Voted
TCAD
2002
15 years 1 months ago
2002
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
113
Voted
TSP
2008
15 years 2 months ago
2008
In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a pro...
117
click to vote
CCS
2000
ACM
15 years 6 months ago
2000
ACM
This paper initiates a study of accountable certificate management methods, necessary to support long-term authenticity of digital documents. Our main contribution is a model for ...
135
click to vote
FOCS
1998
IEEE
15 years 6 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...