Sciweavers

3934 search results - page 144 / 787
» Approximate Schedulability Analysis
Sort
View
IPPS
2003
IEEE
15 years 11 months ago
Grid Harvest Service: A System for Long-Term, Application-Level Task Scheduling
With the emergence of grid computing environment, performance measurement, analysis and prediction of non-dedicated distributed systems have become increasingly important. In this...
Xian-He Sun, Ming Wu
ORL
2007
47views more  ORL 2007»
15 years 5 months ago
A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
We present a very simple way of derandomizing the algorithm proposed by Gupta, Kumar and Roughgarden for Single Source Rent-or-Buy by using the method of conditional expectation. ...
David P. Williamson, Anke van Zuylen
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
15 years 7 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre
SIAMCOMP
2008
123views more  SIAMCOMP 2008»
15 years 6 months ago
Approximation Algorithms for Biclustering Problems
One of the main goals in the analysis of microarray data is to identify groups of genes and groups of experimental conditions (including environments, individuals, and tissues) tha...
Lusheng Wang, Yu Lin, Xiaowen Liu
MMAS
2010
Springer
15 years 1 months ago
Sharp Stability Estimates for the Force-Based Quasicontinuum Approximation of Homogeneous Tensile Deformation
The accuracy of atomistic-to-continuum hybrid methods can be guaranteed only for deformations where the lattice configuration is stable for both the atomistic energy and the hybrid...
Matthew Dobson, Mitchell Luskin, Christoph Ortner