711 search results - page 68 / 143 » Optimal placement by branch-and-price |
DSN
2008
IEEE
14 years 2 months ago
2008
IEEE
: The consolidation of multiple servers and their workloads aims to minimize the number of servers needed thereby enabling the efficient use of server and power resources. At the s...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Let O = {O1, . . . , Om} be a set of m convex polygons in R2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without refle...
HEURISTICS
1998
13 years 7 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
ICDE
2006
IEEE
14 years 1 months ago
2006
IEEE
We consider the problem of query optimization in distributed stream based systems where multiple continuous queries may be executing simultaneously. In such systems, distribution ...
SC
2000
ACM
14 years 7 days ago
2000
ACM
This paper describes extensions to OpenMP that implement data placement features needed for NUMA architectures. OpenMP is a collection of compiler directives and library routines ...