Sciweavers

4816 search results - page 673 / 964
» Performance analysis of the AntNet algorithm
Sort
View
JACM
2006
98views more  JACM 2006»
15 years 6 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson
JACM
1998
88views more  JACM 1998»
15 years 6 months ago
A Threshold of ln n for Approximating Set Cover
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
Uriel Feige
TEC
2002
183views more  TEC 2002»
15 years 6 months ago
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
Maurice Clerc, James Kennedy
TSE
2010
136views more  TSE 2010»
15 years 5 months ago
A Theoretical and Empirical Study of Search-Based Testing: Local, Global, and Hybrid Search
Search based optimization techniques have been applied to structural software test data generation since 1992, with a recent upsurge in interest and activity within this area. How...
Mark Harman, Phil McMinn
SAT
2010
Springer
172views Hardware» more  SAT 2010»
15 years 5 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin