Sciweavers

1673 search results - page 225 / 335
» Generalized Elastic Scheduling
Sort
View
158
Voted
ECAI
2008
Springer
15 years 8 months ago
Solving Necklace Constraint Problems
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
Pierre Flener, Justin Pearson
EDBT
2008
ACM
140views Database» more  EDBT 2008»
15 years 8 months ago
Database Servers Tailored to Improve Energy Efficiency
Database software can be tailored for specific application domains and their required functionality, for specific hardware and its characteristics, or for other purposes. This bri...
Goetz Graefe
EDM
2010
309views Data Mining» more  EDM 2010»
15 years 7 months ago
A Case Study: Data Mining Applied to Student Enrollment
One of the main problems faced by university students is deciding the right learning path based on available information such as courses, schedules and professors. In this context,...
César Vialardi Sacín, Jorge Chue, Al...
IPCO
2008
114views Optimization» more  IPCO 2008»
15 years 7 months ago
The Stochastic Machine Replenishment Problem
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
Kamesh Munagala, Peng Shi
IMECS
2007
15 years 7 months ago
A Hybrid Markov Model for Accurate Memory Reference Generation
—Workload characterisation and generation is becoming an increasingly important area as hardware and application complexities continue to advance. In this paper, we introduce a c...
Rahman Hassan, Antony Harris