5580 search results - page 50 / 1116 » Randomized priority algorithms |
CP
2006
Springer
15 years 1 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
CAAN
2007
Springer
15 years 3 months ago
2007
Springer
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
ICALP
2009
Springer
15 years 4 months ago
2009
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high p...
CCA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtaine...
FSTTCS
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...