5138 search results - page 101 / 1028 » Randomized Algorithms for 3-SAT |
125
click to vote
COMBINATORICS
2002
15 years 1 months ago
2002
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
102
Voted
CORR
2004
Springer
15 years 1 months ago
2004
Springer
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of...
139
Voted
COLOGNETWENTE
2010
15 years 13 days ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
124
Voted
INCDM
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Clustering algorithms for multidimensional numerical data must overcome special difficulties due to the irregularities of data distribution. We present a clustering algo...
100
Voted
ECAI
2006
Springer
15 years 5 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...