Sciweavers

586 search results - page 15 / 118
» A Recursive Technique for Computing Lower-Bound Performance ...
Sort
View
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 7 months ago
Error Analysis of Approximated PCRLBs for Nonlinear Dynamics
In practical nonlinear filtering, the assessment of achievable filtering performance is important. In this paper, we focus on the problem of how to efficiently approximate the post...
Ming Lei, Pierre Del Moral, Christophe Baehr
GPC
2008
Springer
13 years 8 months ago
Work Stealing Technique and Scheduling on the Critical Path
This paper is about a new framework for high performance thread scheduling based on the work stealing principle when processors may run at different speed. We also take into accou...
Christophe Cérin, Michel Koskas
EUROSYS
2010
ACM
14 years 4 months ago
Delay Scheduling: A Simple Technique for Achieving Locality and Fairness in Cluster Scheduling
As organizations start to use data-intensive cluster computing systems like Hadoop and Dryad for more applications, there is a growing need to share clusters between users. Howeve...
Matei Zaharia, Dhruba Borthakur, Joydeep Sen Sarma...
STOC
1999
ACM
106views Algorithms» more  STOC 1999»
13 years 12 months ago
Scheduling in the Dark
We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when ...
Jeff Edmonds
RANDOM
1998
Springer
13 years 12 months ago
On-Line Bin-Stretching
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
Yossi Azar, Oded Regev