Sciweavers

14165 search results - page 204 / 2833
» The generalized two-server problem
Sort
View
COMPUTING
2007
78views more  COMPUTING 2007»
15 years 4 months ago
Calculating lower bounds for caching problems
We present a general method for computing lower bounds for various caching problems. We apply the method to two well known problems, companion caching and weighted caching. For we...
Leah Epstein, Rob van Stee
COR
2008
133views more  COR 2008»
15 years 4 months ago
A new constraint programming approach for the orthogonal packing problem
The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of rectangles can be packed in a larger rectangle of fixed size. We propose an exact method ...
François Clautiaux, Antoine Jouglet, Jacque...
CEC
2005
IEEE
15 years 10 months ago
An ant algorithm hyperheuristic for the project presentation scheduling problem
Abstract- Ant algorithms have generated significant research interest within the search/optimisation community in recent years. Hyperheuristic research is concerned with the devel...
Edmund K. Burke, Graham Kendall, Dario Landa Silva...
COLT
2005
Springer
15 years 10 months ago
Localized Upper and Lower Bounds for Some Estimation Problems
Abstract. We derive upper and lower bounds for some statistical estimation problems. The upper bounds are established for the Gibbs algorithm. The lower bounds, applicable for all ...
Tong Zhang
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 10 months ago
Symbolic regression in multicollinearity problems
In this paper the potential of GP-generated symbolic regression for alleviating multicollinearity problems in multiple regression is presented with a case study in an industrial s...
Flor A. Castillo, Carlos M. Villa