4377 search results - page 358 / 876 » Mass problems and randomness |
198
click to vote
PPSN
2004
Springer
16 years 5 days ago
2004
Springer
We consider the problem of finding small Golomb rulers, a hard combinatorial optimization task. This problem is here tackled by means of a hybrid evolutionary algorithm (EA). This...
151
click to vote
STACS
2004
Springer
16 years 5 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 ...
191
Voted
ISCIS
2003
Springer
16 years 12 hour ago
2003
Springer
In this paper, we study an adaptive random search method based on continuous action-set learning automaton for solving stochastic optimization problems in which only the noisecorr...
187
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...
159
click to vote
ECP
1999
Springer
15 years 11 months ago
1999
Springer
In this paper we study the consistency problem for a set of disjunctive temporal constraints [Stergiou and Koubarakis, 1998]. We propose two SAT-based procedures, and show that—o...