5138 search results - page 106 / 1028 » Randomized Algorithms for 3-SAT |
COCOON
2007
Springer
15 years 8 months ago
2007
Springer
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...
139
click to vote
SLS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
107
click to vote
SAT
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
SPAA
2000
ACM
15 years 6 months ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
130
Voted
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...