Sciweavers

5153 search results - page 271 / 1031
» Introduction to Randomized Algorithms
Sort
View
162
Voted
ACST
2006
15 years 5 months ago
An efficient search algorithm for partially ordered sets
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
Yan Chen
104
Voted
CORR
2008
Springer
128views Education» more  CORR 2008»
15 years 3 months ago
A Quantifier Elimination Algorithm for Linear Real Arithmetic
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutines satisfiability modulo this theory and polyhedral pro...
David Monniaux
125
Voted
PRL
2007
150views more  PRL 2007»
15 years 3 months ago
A method for initialising the K-means clustering algorithm using kd-trees
We present a method for initialising the K-means clustering algorithm. Our method hinges on the use of a kd-tree to perform a density estimation of the data at various locations. ...
Stephen J. Redmond, Conor Heneghan
174
Voted
ECCC
2011
190views ECommerce» more  ECCC 2011»
14 years 7 months ago
Optimal heuristic algorithms for the image of an injective function
The existence of optimal algorithms is not known for any decision problem in NP \ P. We consider the problem of testing the membership in the image of an injective function. We co...
Edward A. Hirsch, Dmitry Itsykson, Valeria Nikolae...
108
Voted
CSCLP
2005
Springer
15 years 9 months ago
A CSP Search Algorithm with Reduced Branching Factor
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...
Igor Razgon, Amnon Meisels