66 search results - page 10 / 14 » Combinatorial Approximation Algorithms for MaxCut using Rand... |
137
Voted
FLAIRS
2004
15 years 3 months ago
2004
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
125
Voted
SIGIR
2006
ACM
15 years 8 months ago
2006
ACM
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
115
Voted
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
162
Voted
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
155
Voted
ANTSW
2010
Springer
15 years 17 days ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...