Sciweavers

2740 search results - page 135 / 548
» Approximating Component Selection
Sort
View
ICDE
2001
IEEE
206views Database» more  ICDE 2001»
16 years 4 months ago
Cache-Aware Query Routing in a Cluster of Databases
We investigate query routing techniques in a cluster of databases for a query-dominant environment. The objective is to decrease query response time. Each component of the cluster...
Uwe Röhm, Klemens Böhm, Hans-Jörg S...
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
15 years 4 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
144
Voted
CORR
2008
Springer
96views Education» more  CORR 2008»
15 years 3 months ago
Improved Approximations for Multiprocessor Scheduling Under Uncertainty
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T...
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
15 years 9 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
CAGD
2008
154views more  CAGD 2008»
15 years 3 months ago
From extension of Loop's approximation scheme to interpolatory subdivisions
The minimum-supported bivariate C2-cubic spline on a 6-directional mesh constructed in our previous work [2] can be used to extend Loop's approximation subdivision scheme to ...
Charles K. Chui, Qingtang Jiang