Sciweavers

2157 search results - page 200 / 432
» Binary ant algorithm
Sort
View
AIR
1998
103views more  AIR 1998»
15 years 6 months ago
Tackling Real-Coded Genetic Algorithms: Operators and Tools for Behavioural Analysis
Abstract. Genetic algorithms play a significant role, as search techniques for handling complex spaces, in many fields such as artificial intelligence, engineering, robotic, etc...
Francisco Herrera, Manuel Lozano, José L. V...
ECCV
2002
Springer
16 years 8 months ago
Evaluating Image Segmentation Algorithms Using the Pareto Front
Image segmentation is the first stage of processing in many practical computer vision systems. While development of particular segmentation algorithms has attracted considerable re...
Mark Everingham, Henk L. Muller, Barry T. Thomas
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 6 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
15 years 7 months ago
Probabilistic analysis of knapsack core algorithms
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
René Beier, Berthold Vöcking
DISOPT
2007
155views more  DISOPT 2007»
15 years 6 months ago
Linear-programming design and analysis of fast algorithms for Max 2-CSP
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
Alexander D. Scott, Gregory B. Sorkin