Sciweavers

1345 search results - page 171 / 269
» Optimal Control With Noisy Time
Sort
View
RTSS
2002
IEEE
15 years 9 months ago
Approximate Schedulability Analysis
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
Samarjit Chakraborty, Simon Künzli, Lothar Th...
COCOON
2007
Springer
15 years 8 months ago
Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
This paper deals with problems which fall into the domain of selfish scheduling: a protocol is in charge of building a schedule for a set of tasks without directly knowing their l...
George Christodoulou, Laurent Gourvès, Fann...
GLOBECOM
2010
IEEE
15 years 2 months ago
A Dynamic Framed ALOHA Scheme for Batch Resolution in Practical CSMA-Based Wireless Networks
Abstract--The batch resolution problem consists in arbitrating the channel access of a group of nodes in a wireless network in order to collect a single packet from each node in th...
Andrea Zanella
QUESTA
2010
93views more  QUESTA 2010»
14 years 11 months ago
Towards an Erlang formula for multiclass networks
Consider a multiclass stochastic network with state dependent service rates and arrival rates describing bandwidth-sharing mechanisms as well as admission control and/or load bala...
Matthieu Jonckheere, Jean Mairesse
EUROGRAPHICS
2010
Eurographics
16 years 1 months ago
The Virtual Director: a Correlation-Based Online Viewing of Human Motion
Automatic camera control for scenes depicting human motion is an imperative topic in motion capture base animation, computer games, and other animation based fields. This challen...
Jackie Assa, Lior Wolf, Daniel Cohen-Or