674 search results - page 19 / 135 » The computational complexity of the parallel knock-out probl... |
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Workforce planning is an important activity that enables organizations to determine the workforce needed for continued success. A workforce planning problem is a very complex task...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
This work focuses on the development of a parallel framework method to improve the effectiveness and the efficiency of the obtained solutions by Multi-objective Evolutionary Algori...
CEC
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract— Over the last years, interest in hybrid metaheuristics has risen considerably in the field of optimization. Combinations of methods such as evolutionary algorithms and...