Sciweavers

14739 search results - page 128 / 2948
» An optimization problem on the sphere
Sort
View
CEC
2009
IEEE
15 years 2 months ago
Benchmarking and solving dynamic constrained problems
— Many real-world dynamic optimisation problems have constraints, and in certain cases not only the objective function changes over time, but the constraints also change as well....
Trung Thanh Nguyen, Xin Yao
71
Voted
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
15 years 1 months ago
Search--based approaches to the component selection and prioritization problem
This poster paper addresses the problem of choosing sets of software components to combine in component
Mark Harman, Alexandros Skaliotis, Kathleen Steinh...
GEOINFORMATICA
2002
92views more  GEOINFORMATICA 2002»
14 years 10 months ago
Using Genetic Algorithms for Solving Hard Problems in GIS
Genetic algorithms (GAs) are powerful combinatorial optimizers that are able to
Steven van Dijk, Dirk Thierens, Mark de Berg
75
Voted
IPCO
2010
131views Optimization» more  IPCO 2010»
14 years 8 months ago
Secretary Problems via Linear Programming
In the classical secretary problem an employer would like to choose the best candidate among
Niv Buchbinder, Kamal Jain, Mohit Singh
83
Voted
JOTA
2010
144views more  JOTA 2010»
14 years 5 months ago
On a PDE Arising in One-Dimensional Stochastic Control Problems
The paper provides a systematic way for finding a partial differential equation that directly characterizes the optimal control, in the framework of one
Ricardo Josa-Fombellida, Juan Pablo Rincón-...