Sciweavers

16596 search results - page 259 / 3320
» Generalized Assignment Problems
Sort
View
FLAIRS
2007
15 years 9 months ago
Naive Bayes and Decision Trees for Function Tagging
This paper describes the use of two machine learning techniques, naive Bayes and decision trees, to address the task of assigning function tags to nodes in a syntactic parse tree....
Mihai C. Lintean, Vasile Rus
IOR
2007
106views more  IOR 2007»
15 years 6 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
JSAC
2006
157views more  JSAC 2006»
15 years 6 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 6 months ago
The overlap number of a graph
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...
Bill Rosgen, Lorna Stewart
SWARM
2012
SPRINGER
329views Optimization» more  SWARM 2012»
14 years 2 months ago
A critical analysis of parameter adaptation in ant colony optimization
Applying parameter adaptation means operating on parameters of an algorithm while it is tackling an instance. For ant colony optimization, several parameter adaptation methods have...
Paola Pellegrini, Thomas Stützle, Mauro Birat...