Sciweavers

6102 search results - page 1089 / 1221
» Generating Optimizing Specializers
Sort
View
HEURISTICS
2006
120views more  HEURISTICS 2006»
15 years 4 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
INTERFACES
2008
77views more  INTERFACES 2008»
15 years 4 months ago
Showcase Scheduling at Fred Astaire East Side Dance Studio
: The ballroom dancing showcases at Fred Astaire East Side Dance Studio in Manhattan are held at least twice a year and provide the students with an environment for socializing, pr...
Miguel A. Lejeune, Nevena Yakova
IOR
2008
104views more  IOR 2008»
15 years 4 months ago
Arrival Rate Approximation by Nonnegative Cubic Splines
Estimating the arrival rate function of a non-homogeneous Poisson process based on observed arrival data is a problem naturally arising in many applications. Cubic spline function...
Farid Alizadeh, Jonathan Eckstein, Nilay Noyan, G&...
ISCI
2008
116views more  ISCI 2008»
15 years 4 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
JAIR
2008
98views more  JAIR 2008»
15 years 4 months ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...
« Prev « First page 1089 / 1221 Last » Next »