352 search results - page 51 / 71 » On the optimal reachability problem of weighted timed automa... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequencydivision multi...
CATS
2006
13 years 9 months ago
2006
We investigate a scheduling problem motivated by pull-based data delivering systems where there is a server keeping a number of pages; and clients requesting the same page can be ...
EMSOFT
2006
Springer
13 years 11 months ago
2006
Springer
Distributed real-time systems require a predictable and verifiable mechanism to control the communication medium. Current real-time communication protocols are typically independe...
STOC
2010
ACM
14 years 12 days ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...