4342 search results - page 251 / 869 » Improved Algorithms for Optimal Embeddings |
151
click to vote
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
139
click to vote
IPPS
1997
IEEE
15 years 9 months ago
1997
IEEE
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
152
click to vote
ANTSW
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications us...
157
click to vote
PPSN
2004
Springer
15 years 11 months ago
2004
Springer
This article describes a new model of probability density function and its use in estimation of distribution algorithms. The new model, the distribution tree, has interesting prope...
158
click to vote
EVOW
2000
Springer
15 years 9 months ago
2000
Springer
Ant Colony Optimization is an evolutionary method that has recently been applied to scheduling problems. We propose an ACO algorithm for the Single Machine Total Weighted Tardiness...