5138 search results - page 453 / 1028 » Randomized Algorithms for 3-SAT |
151
click to vote
STACS
2004
Springer
16 years 6 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 ...
188
click to vote
GECCO
2003
Springer
16 years 2 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...
190
click to vote
SSIAI
2002
IEEE
15 years 11 months 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...
200
click to vote
SPAA
1998
ACM
15 years 10 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...
206
click to vote
PATAT
2000
Springer
15 years 10 months ago
2000
Springer
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...