5138 search results - page 96 / 1028 » Randomized Algorithms for 3-SAT |
149
Voted
SIAMCOMP
2010
14 years 8 months ago
2010
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
143
Voted
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Investigating and enhancing the performance of genetic algorithms in dynamic environments have attracted a growing interest from the community of genetic algorithms in recent year...
130
Voted
IJCAI
2007
15 years 3 months ago
2007
Clustering accuracy of partitional clustering algorithm for categorical data primarily depends upon the choice of initial data points (modes) to instigate the clustering process. ...
121
click to vote
AMAI
1999
Springer
15 years 1 months ago
1999
Springer
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
STACS
2010
Springer
15 years 8 months ago
2010
Springer
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...