Sciweavers

1964 search results - page 11 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
CVPR
2001
IEEE
14 years 9 months ago
Convex and Non-convex Illuminant Constraints for Dichromatic Colour Constancy
The dichromatic reflectance model introduced by Shafer [16] predicts that the colour signals of most materials fall on a plane spanned by a vector due to the material and a vector...
Graham D. Finlayson, Gerald Schaefer
CAEPIA
2003
Springer
14 years 26 days ago
A New Genetic Approach for the Partitioning Problem in Distributed Virtual Environment Systems
The Partitioning problem is a key issue in the design of Distributed Virtual Environment (DVE) systems based on a server-network architecture. This problem consist of efficiently ...
Pedro Morillo, Pedro López, Juan M. Ordu&nt...
PR
2008
93views more  PR 2008»
13 years 7 months ago
Genetic algorithm-based feature set partitioning for classification problems
Feature set partitioning generalizes the task of feature selection by partitioning the feature set into subsets of features that are collectively useful, rather than by finding a ...
Lior Rokach
ORL
2000
77views more  ORL 2000»
13 years 7 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
ATMOS
2007
183views Optimization» more  ATMOS 2007»
13 years 9 months ago
Solving Large Scale Crew Scheduling Problems by using Iterative Partitioning
This paper deals with large-scale crew scheduling problems arising at the Dutch railway operator, Netherlands Railways (NS). We discuss several methods to partition large instances...
Erwin J. W. Abbink, Joel Van't Wout, Dennis Huisma...