Sciweavers

5506 search results - page 1049 / 1102
» Minimal Logic Programs
Sort
View
COR
2007
106views more  COR 2007»
13 years 7 months ago
On a stochastic sequencing and scheduling problem
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
Antonio Alonso-Ayuso, Laureano F. Escudero, M. Ter...
OSN
2007
185views more  OSN 2007»
13 years 7 months ago
Comparison of ILP formulations for the RWA problem
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
Brigitte Jaumard, Christophe Meyer, B. Thiongane
ICALP
2011
Springer
12 years 11 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
SIGMOD
2011
ACM
158views Database» more  SIGMOD 2011»
12 years 10 months ago
Workload-aware database monitoring and consolidation
In most enterprises, databases are deployed on dedicated database servers. Often, these servers are underutilized much of the time. For example, in traces from almost 200 producti...
Carlo Curino, Evan P. C. Jones, Samuel Madden, Har...
ASPLOS
2012
ACM
12 years 3 months ago
DejaVu: accelerating resource allocation in virtualized environments
Effective resource management of virtualized environments is a challenging task. State-of-the-art management systems either rely on analytical models or evaluate resource allocati...
Nedeljko Vasic, Dejan M. Novakovic, Svetozar Miuci...
« Prev « First page 1049 / 1102 Last » Next »