234 search results - page 13 / 47 » Randomized splay trees: Theoretical and experimental results |
141
click to vote
JUCS
2007
15 years 5 months ago
2007
Abstract: We present a new type of sat problem called the k-gd-sat, which generalizes k-sat and gd-sat. In k-gd-sat, clause lengths have geometric distribution, controlled by a pro...
109
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. A simple nonconstructive argument shows that most 3CNF formulas with cn clauses (where c is a large enough constant) are not satisfiable. It is an open question whether ...
126
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
This paper compares the performances of a vibrationpowered electrical generators using PZT piezoelectric ceramic associated to two different power conditioning circuits. A new app...
171
click to vote
AAAI
1996
15 years 7 months ago
1996
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
190
click to vote
DIS
2001
Springer
15 years 10 months ago
2001
Springer
In the context of classification problems, algorithms that generate multivariate trees are able to explore multiple representation languages by using decision tests based on a com...