5138 search results - page 141 / 1028 » Randomized Algorithms for 3-SAT |
107
click to vote
STOC
2002
ACM
16 years 2 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
121
click to vote
WIA
2009
Springer
15 years 8 months ago
2009
Springer
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential le...
OOPSLA
2007
Springer
15 years 8 months ago
2007
Springer
RANDOOP FOR JAVA generates unit tests for Java code using feedback-directed random test generation. Below we describe RANDOOP’s input, output, and test generation algorithm. We ...
112
click to vote
WEA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
DAWAK
2005
Springer
15 years 7 months ago
2005
Springer
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...