1289 search results - page 51 / 258 » Complexity of Counting the Optimal Solutions |
129
click to vote
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
— Genetic algorithms (GAs) have been argued to constitute a flexible search thereby enabling to solve difficult problems which classical optimization methodologies may find ha...
127
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
We present a SAT-based approach to the task and message allocation problem of distributed real-time systems with hierarchical architectures. In contrast to the heuristic approache...
116
click to vote
EMO
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. In this paper, we propose an approach for solving hierarchical multi-objective optimization problems (MOPs). In realistic MOPs, two main challenges have to be considered:...
114
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
In this article, new variation operators for evolutionary multiobjective algorithms (EMOA) are proposed. On the basis of a predator-prey model theoretical considerations as well a...
135
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...