Sciweavers

388 search results - page 34 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
14 years 13 days ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
CVPR
2010
IEEE
14 years 5 months ago
Robust video denoising using low rank matrix completion
Most existing video denoising algorithms assume a single statistical model of image noise, e.g. additive Gaussian white noise, which often is violated in practice. In this paper, ...
Hui Ji, Chaoqiang Liu, Zuowei Shen, Yuhong Xu
ICIW
2008
IEEE
14 years 3 months ago
NAT Traversal Method for Multi-Agent-Based Meeting Scheduling System
—We previously proposed a meeting scheduling system based on mobile agent technology. The users of our system do not need to input all of their schedules unlike the existing grou...
Yusuke Hamada, Shinichi Motomura, Takao Kawamura, ...
GECCO
2008
Springer
108views Optimization» more  GECCO 2008»
13 years 10 months ago
The effects of mutation and directed intervention crossover when applied to scheduling chemotherapy
This paper discusses the effects of mutation and directed intervention crossover approaches when applied to the derivation of cancer chemotherapy treatment schedules. Unlike trad...
Paul M. Godley, David E. Cairns, Julie Cowie, Kevi...
CORR
2008
Springer
132views Education» more  CORR 2008»
13 years 9 months ago
Building Better Nurse Scheduling Algorithms
The aim of this research is twofold: Firstly, to model and solve a complex nurse scheduling problem with an integer programming formulation and evolutionary algorithms. Secondly, ...
Uwe Aickelin, Paul White