5138 search results - page 284 / 1028 » Randomized Algorithms for 3-SAT |
189
click to vote
SIGMOD
1998
ACM
15 years 10 months ago
1998
ACM
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
161
click to vote
GECCO
2007
Springer
16 years 22 days ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
205
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper addresses strategies for the stable marriage problem. For the Gale-Shapley algorithm with men proposing, a classical theorem states that it is impossible for e...
168
click to vote
EURODAC
1995
IEEE
15 years 10 months ago
1995
IEEE
Iterative improvement partitioning algorithms such as the FM algorithm of Fiduccia and Mattheyses 8 , the algorithm of Krishnamurthy 13 , and Sanchis's extensions of these al...
174
click to vote
IPCO
2010
15 years 8 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...