Sciweavers

874 search results - page 76 / 175
» Optimal Scheduling of Contract Algorithms for Anytime Proble...
Sort
View
EOR
2007
364views more  EOR 2007»
14 years 9 months ago
Heuristics for the mirrored traveling tournament problem
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
Celso C. Ribeiro, Sebastián Urrutia
GECCO
2006
Springer
265views Optimization» more  GECCO 2006»
15 years 1 months ago
Cutting stock waste reduction using genetic algorithms
A new model for the One-dimensional Cutting Stock problem using Genetic Algorithms (GA) is developed to optimize construction steel bars waste. One-dimensional construction stocks...
Yaser M. A. Khalifa, O. Salem, A. Shahin
IJCV
1998
105views more  IJCV 1998»
14 years 9 months ago
Robust Algorithms for Object Localization
Object localization using sensed data features and corresponding model features is a fundamental problem in machine vision. We reformulate object localization as a least squares p...
Aaron S. Wallack, Dinesh Manocha
AIPS
2006
14 years 11 months ago
Spacetrack: Trading off Quality and Utilization in Oversubscribed Schedules
Many scheduling problems are posed as optimization problems where the goal is to find a feasible schedule that maximizes the utilization of some resource. In some domains it is al...
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitle...
CP
2005
Springer
15 years 3 months ago
Sub-optimality Approximations
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
Russell Bent, Irit Katriel, Pascal Van Hentenryck