478 search results - page 18 / 96 » A simple expected running time analysis for randomized |
ECCC
2000
13 years 8 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. A simple nonconstructive argument shows that most 3CNF formulas with cn clauses (where c is a large enough constant) are not satisfiable. It is an open question whether ...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
PE
2007
Springer
13 years 8 months ago
2007
Springer
Grid computing is an emerging technology by which huge numbers of processors over the world create a global source of processing power. Their collaboration makes it possible to pe...
CCCG
2006
13 years 9 months ago
2006
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...