Sciweavers

9997 search results - page 395 / 2000
» The case for crowd computing
Sort
View
TCS
2010
15 years 1 months ago
Resource allocation with time intervals
We study a resource allocation problem where jobs have the following characteristics: Each job consumes some quantity of a bounded resource during a certain time interval and indu...
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
EUROPAR
2009
Springer
15 years 11 months ago
Modeling Resubmission in Unreliable Grids: The Bottom-Up Approach
Abstract. Failure is an ordinary characteristic of large-scale distributed environments. Resubmission is a general strategy employed to cope with failures in grids. Here, we analyt...
Vandy Berten, Emmanuel Jeannot
SCCC
1998
IEEE
15 years 11 months ago
Dynamic Programming as Frame for Efficient Parsing
The last few years have seen a renewal of interest in the consideration of dynamic programming in compiler technology. This is due to the compactness of the representations, which...
Manuel Vilares Ferro, Miguel A. Alonso, David Cabr...
ISSAC
1995
Springer
119views Mathematics» more  ISSAC 1995»
15 years 10 months ago
The Singular Value Decomposition for Polynomial Systems
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
Robert M. Corless, Patrizia M. Gianni, Barry M. Tr...
CCGRID
2010
IEEE
15 years 8 months ago
Dynamic Auction Mechanism for Cloud Resource Allocation
We propose a dynamic auction mechanism to solve the allocation problem of computation capacity in the environment of cloud computing. Truth-telling property holds when we apply a s...
Wei-Yu Lin, Guan-Yu Lin, Hung-Yu Wei