1013 search results - page 17 / 203 » A Subexponential Algorithm for Abstract Optimization Problem... |
COCOA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
WEA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize the amplitude of the electrical current flowing ...
HOLOMAS
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. This paper introduces a framework based on multi-agent system for solving problems of combinatorial optimization. The framework allows running various metaheuristic algor...
105
click to vote
ADBIS
2010
Springer
14 years 10 months ago
2010
Springer
al Partitioning by Predicate Abstraction and its Application to Data Warehouse Design Aleksandar Dimovski1 , Goran Velinov2 , and Dragan Sahpaski2 1 Faculty of Information-Communic...
70
Voted
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Recent theoretical work helped explain certain optimizationrelated pathologies in cooperative coevolutionary algorithms (CCEAs). Such explanations have led to adopting sp...