5138 search results - page 88 / 1028 » Randomized Algorithms for 3-SAT |
125
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
112
click to vote
AI
2006
Springer
15 years 5 months ago
2006
Springer
Stochastic local search (SLS) methods are underlying some of the best-performing algorithms for certain types of SAT instances, both from an empirical as well as from a theoretical...
99
Voted
CSC
2009
15 years 2 months ago
2009
Random walk simulation is employed in many experimental algorithmic applications. Efficient execution on modern computer architectures demands that the random walk be implemented t...
98
Voted
WAW
2007
Springer
15 years 7 months ago
2007
Springer
STOC
1993
ACM
15 years 5 months ago
1993
ACM