Sciweavers

10106 search results - page 482 / 2022
» Algorithm Selection and Scheduling
Sort
View
241
Voted
IPCO
1998
152views Optimization» more  IPCO 1998»
15 years 9 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz
EOR
2008
91views more  EOR 2008»
15 years 7 months ago
Dominance-based heuristics for one-machine total cost scheduling problems
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...
Antoine Jouglet, David Savourey, Jacques Carlier, ...
IPPS
2007
IEEE
16 years 1 months ago
Library Function Selection in Compiling Octave
One way to address the continuing performance problem of high-level domain-specific languages, such as Octave or MATLAB, is to compile them to a relatively lower level language f...
Daniel McFarlin, Arun Chauhan
IEAAIE
2003
Springer
16 years 24 days ago
Fast Feature Selection by Means of Projections
The attribute selection techniques for supervised learning, used in the preprocessing phase to emphasize the most relevant attributes, allow making models of classification simple...
Roberto Ruiz, José Cristóbal Riquelm...
203
Voted
GECCO
2010
Springer
193views Optimization» more  GECCO 2010»
16 years 12 days ago
Fitness-AUC bandit adaptive strategy selection vs. the probability matching one within differential evolution: an empirical comp
The choice of which of the available strategies should be used within the Differential Evolution algorithm for a given problem is not trivial, besides being problem-dependent and...
Álvaro Fialho, Marc Schoenauer, Michè...