Sciweavers

3142 search results - page 120 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
JCO
2002
96views more  JCO 2002»
15 years 2 months ago
On the Robust Single Machine Scheduling Problem
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
Jian Yang, Gang Yu
SMI
2010
IEEE
208views Image Analysis» more  SMI 2010»
15 years 1 months ago
Local Constraint-Based General Surface Deformation
—This paper develops a framework for locally deforming either a parametric surface or hierarchical subdivision surface to match a set of positional and energy minimizing constrai...
Richard Pusch, Faramarz Samavati
AMAI
1999
Springer
15 years 2 months ago
Maintenance scheduling problems as benchmarks for constraint algorithms
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
Daniel Frost, Rina Dechter
GECCO
2004
Springer
106views Optimization» more  GECCO 2004»
15 years 8 months ago
Run Transferable Libraries - Learning Functional Bias in Problem Domains
Abstract. This paper introduces the notion of Run Transferable Libraries, a mechanism to pass knowledge acquired in one GP run to another. We demonstrate that a system using these ...
Maarten Keijzer, Conor Ryan, Mike Cattolico
ISAAC
2003
Springer
104views Algorithms» more  ISAAC 2003»
15 years 8 months ago
Deterministic Algorithm for the t-Threshold Set Problem
Given k sorted arrays, the t-Threshold problem, which is motivated by indexed search engines, consists of finding the elements which are present in at least t of the arrays. We pr...
Jérémy Barbay, Claire Kenyon