Sciweavers

6562 search results - page 122 / 1313
» Noetherianity and Combination Problems
Sort
View
JSW
2008
99views more  JSW 2008»
15 years 6 months ago
Using Data Mining in MURA Graphic Problems
The MURA phenomenon will result lots of problems in Photomask and TFT-LCD industries as well. In this paper, we designed and developed a MURA related association rules which suitab...
Wen-Hsing Kao, Jason C. Hung, Victoria Hsu
ENGL
2007
121views more  ENGL 2007»
15 years 6 months ago
A Comparison between Genetic Algorithms and Evolutionary Programming based on Cutting Stock Problem
—Genetic Algorithms (GA) and Evolutionary Programming (EP) are two well-known optimization methods that belong to the class of Evolutionary Algorithms (EA). Both methods have gen...
Raymond Chiong, Ooi Koon Beng
146
Voted
4OR
2004
99views more  4OR 2004»
15 years 5 months ago
Upper bounds for revenue maximization in a satellite scheduling problem
This paper presents upper bounds for the Satellite Revenue Selection and Scheduling problem (SRSS). A compact model of this generalized Prize Collecting Traveling Salesman Problem ...
Thierry Benoist, Benoît Rottembourg
ANOR
2002
99views more  ANOR 2002»
15 years 5 months ago
A General Approach to the Physician Rostering Problem
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
Louis-Martin Rousseau, Gilles Pesant, Michel Gendr...
TEC
2002
163views more  TEC 2002»
15 years 5 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon