Sciweavers

5153 search results - page 440 / 1031
» Introduction to Randomized Algorithms
Sort
View
GECCO
2003
Springer
130views Optimization» more  GECCO 2003»
15 years 11 months ago
A New Approach to Improve Particle Swarm Optimization
Abstract. Particle swarm optimization (PSO) is a new evolutionary computation technique. Although PSO algorithm possesses many attractive properties, the methods of selecting inert...
Liping Zhang, Huanjun Yu, Shangxu Hu
SSIAI
2002
IEEE
15 years 11 months ago
Two Dimensional Projective Point Matching
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...
Jason Denton, J. Ross Beveridge
SPAA
1998
ACM
15 years 9 months ago
Analyses of Load Stealing Models Based on Differential Equations
In this paper we develop models for and analyze several randomized work stealing algorithms in a dynamic setting. Our models represent the limiting behavior of systems as the numb...
Michael Mitzenmacher
182
Voted
PATAT
2000
Springer
124views Education» more  PATAT 2000»
15 years 9 months ago
Tabu Search Techniques for Examination Timetabling
Abstract The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairl...
Luca Di Gaspero, Andrea Schaerf
CATS
2008
15 years 7 months ago
On the Efficiency of Pollard's Rho Method for Discrete Logarithms
Pollard's rho method is a randomized algorithm for computing discrete logarithms. It works by defining a pseudo-random sequence and then detecting a match in the sequence. Ma...
Shi Bai, Richard P. Brent