1568 search results - page 20 / 314 » The problem of examination questions in algorithmics |
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
We consider algorithms for load balancing on unreliable machines. The objective is to optimize the two criteria of minimizing the makespan and minimizing job reassignments in resp...
SEAL
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. Robustness has long been recognised as a critical issue for coevolutionary learning. It has been achieved in a number of cases, though usually in domains which involve so...
PPSN
1998
Springer
15 years 2 months ago
1998
Springer
This paper presents a novel evolutionary approach of approximating the shape of the Pareto-optimal set of multi-objective optimization problems. The evolutionary algorithm (EA) use...