Sciweavers

13376 search results - page 300 / 2676
» Problem Solving with
Sort
View
154
Voted
ICTAI
2009
IEEE
15 years 1 months ago
A Confidence-Based Dominance Operator in Evolutionary Algorithms for Noisy Multiobjective Optimization Problems
This paper describes a noise-aware dominance operator for evolutionary algorithms to solve the multiobjective optimization problems (MOPs) that contain noise in their objective fu...
Pruet Boonma, Junichi Suzuki
GECCO
2005
Springer
219views Optimization» more  GECCO 2005»
15 years 9 months ago
An evolutionary lagrangian method for the 0/1 multiple knapsack problem
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
Yourim Yoon, Yong-Hyuk Kim, Byung Ro Moon
GECCO
2004
Springer
124views Optimization» more  GECCO 2004»
15 years 9 months ago
A Statistical Model of GA Dynamics for the OneMax Problem
A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...
Bulent Buyukbozkirli, Erik D. Goodman
JMIV
2006
58views more  JMIV 2006»
15 years 4 months ago
On the Probability of the Number of Solutions for the P4P Problem
This paper studies the multi-solution phenomenon for the perspective four point (P4P) problem from geometric and algebraic aspects. We give a pure geometric proof that the P4P pro...
Xiao-Shan Gao, Jianliang Tang
DAGSTUHL
2004
15 years 5 months ago
On the Complexity of Parabolic Initial Value Problems with Variable Drift
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
Knut Petras, Klaus Ritter