Sciweavers

4488 search results - page 64 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
COR
2010
150views more  COR 2010»
15 years 3 months ago
Black box scatter search for general classes of binary optimization problems
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...
Francisco Gortázar, Abraham Duarte, Manuel ...
ISICA
2007
Springer
15 years 9 months ago
A New Evolutionary Decision Theory for Many-Objective Optimization Problems
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 ...
Zhuo Kang, Lishan Kang, Xiufen Zou, Minzhong Liu, ...
GECCO
2010
Springer
200views Optimization» more  GECCO 2010»
15 years 8 months ago
Multivariate multi-model approach for globally multimodal problems
This paper proposes an estimation of distribution algorithm (EDA) aiming at addressing globally multimodal problems, i.e., problems that present several global optima. It can be r...
Chung-Yao Chuang, Wen-Lian Hsu
ICCAD
2008
IEEE
127views Hardware» more  ICCAD 2008»
16 years 7 hour ago
Verification of arithmetic datapaths using polynomial function models and congruence solving
Abstract— This paper addresses the problem of solving finite word-length (bit-vector) arithmetic with applications to equivalence verification of arithmetic datapaths. Arithmet...
Neal Tew, Priyank Kalla, Namrata Shekhar, Sivaram ...
AI
2006
Springer
15 years 3 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang