2126 search results - page 52 / 426 » An optimization algorithm for imprecise multi-objective prob... |
105
click to vote
ISICA
2007
Springer
15 years 10 months ago
2007
Springer
In this paper the authors point out that the Pareto Optimality is unfair, unreasonable and imperfect for Many-objective Optimization Problems (MOPs) underlying the hypothesis that ...
147
click to vote
ICANN
2001
Springer
15 years 8 months ago
2001
Springer
In many practical engineering design problems, the form of objective function is not given explicitly in terms of design variables. Given the value of design variables, under this ...
157
Voted
ASIAN
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
117
Voted
JCO
2006
15 years 4 months ago
2006
Consider the problem of partitioning n nonnegative numbers into p parts, where part i can be assigned ni numbers with ni lying in a given range. The goal is to maximize a Schur con...
127
click to vote
ASPDAC
2006
ACM
15 years 8 months ago
2006
ACM
Abstract-- This paper presents a fundamental result on buffer sizing. Given an interconnection wire with n buffers evenly spaced along the wire, we would like to size all buffers s...