Sciweavers

6562 search results - page 6 / 1313
» Noetherianity and Combination Problems
Sort
View
EOR
2008
140views more  EOR 2008»
13 years 9 months ago
Combining two pheromone structures for solving the car sequencing problem with Ant Colony Optimization
The car sequencing problem involves scheduling cars along an assembly line while satisfying capacity constraints. In this paper, we describe an Ant Colony Optimization (ACO) algor...
Christine Solnon
RANLP
2003
13 years 11 months ago
Combining independent modules in lexical multiple-choice problems
Existing statistical approaches to natural language problems are very coarse approximations to the true complexity of language processing. As such, no single technique will be bes...
Peter D. Turney, Michael L. Littman, Jeffrey Bigha...
COR
2006
120views more  COR 2006»
13 years 9 months ago
A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
Home health care, i.e. visiting and nursing patients in their homes, is a growing sector in the medical service business. From a staff rostering point of view, the problem is to f...
Stefan Bertels, Torsten Fahle
AVBPA
2003
Springer
140views Biometrics» more  AVBPA 2003»
14 years 3 months ago
Combining SVM Classifiers for Multiclass Problem: Its Application to Face Recognition
Abstract. In face recognition, a simple classifier such as NNk − is frequently used. For a robust system, it is common to construct the multiclass classifier by combining the out...
Jaepil Ko, Hyeran Byun
EVOW
2007
Springer
14 years 3 months ago
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
Sandro Pirkwieser, Günther R. Raidl, Jakob Pu...