5138 search results - page 396 / 1028 » Randomized Algorithms for 3-SAT |
227
click to vote
TCS
2011
15 years 1 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
189
Voted
SECON
2008
IEEE
16 years 1 months ago
2008
IEEE
—We describe and evaluate a suite of distributed and computationally efficient algorithms for solving a class of convex optimization problems in wireless sensor networks. The pr...
170
click to vote
AAAI
1996
15 years 8 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
111
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3 ) field operations and O(n) random v...
167
click to vote
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
We present a new incremental algorithm for constructing the union of n triangles in the plane. In our experiments, the new algorithm, which we call the Disjoint-Cover (DC) algorit...