5115 search results - page 432 / 1023 » On Randomized Lanczos Algorithms |
208
click to vote
OR
2005
Springer
16 years 1 months ago
2005
Springer
In the open route version of the well-known vehicle routing problem, vehicles are not required to return to the depot; or if they are required, then they return by traveling the sa...
170
click to vote
STACS
2004
Springer
16 years 28 days ago
2004
Springer
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
202
click to vote
GECCO
2003
Springer
16 years 24 days ago
2003
Springer
Abstract. Particle swarm optimization (PSO) is a new evolutionary computation technique. Although PSO algorithm possesses many attractive properties, the methods of selecting inert...
206
Voted
SSIAI
2002
IEEE
16 years 15 days ago
2002
IEEE
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...
221
click to vote
SPAA
1998
ACM
15 years 11 months ago
1998
ACM
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...