800 search results - page 11 / 160 » Understanding Algorithm Performance on an Oversubscribed Sch... |
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
ISOLA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. This article deals with performance verifications of architecture models of real-time embedded systems. We focus on models verified with the real-time scheduling theory...
IJCV
2006
13 years 7 months ago
2006
We present a new approach to the algorithmic study of planar curves, with applications to estimations of contours in images. We construct spaces of curves satisfying constraints su...
KDD
2012
ACM
11 years 9 months ago
2012
ACM
Most existing research about online trust assumes static trust relations between users. As we are informed by social sciences, trust evolves as humans interact. Little work exists...
EMSOFT
2011
Springer
12 years 7 months ago
2011
Springer
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...