Sciweavers

3055 search results - page 113 / 611
» Randomized Search Trees
Sort
View
AAAI
2008
14 years 21 days ago
Backdoor Trees
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...
Marko Samer, Stefan Szeider
TCAD
2002
128views more  TCAD 2002»
13 years 10 months ago
Preferred direction Steiner trees
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
Mehmet Can Yildiz, Patrick H. Madden
TSP
2008
99views more  TSP 2008»
13 years 10 months ago
Sphere Decoding With a Probabilistic Tree Pruning
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...
Byonghyo Shim, Insung Kang
CCS
2000
ACM
14 years 2 months ago
Accountable certificate management using undeniable attestations
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 ...
Ahto Buldas, Peeter Laud, Helger Lipmaa
FOCS
1998
IEEE
14 years 2 months ago
Parametric and Kinetic Minimum Spanning Trees
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...
Pankaj K. Agarwal, David Eppstein, Leonidas J. Gui...