720 search results - page 36 / 144 » Broadcast scheduling: algorithms and complexity |
178
click to vote
AAIM
2006
Springer
16 years 6 hour ago
2006
Springer
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
192
click to vote
ECRTS
2009
IEEE
15 years 3 months ago
2009
IEEE
Some applications for real-time scheduling have target demands in addition to the commonly used starttime and deadline constraints: a task should be executed at a target point in ...
166
click to vote
DIALM
2010
ACM
15 years 4 months ago
2010
ACM
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
191
click to vote
JSAC
2007
15 years 5 months ago
2007
Abstract— Cooperative diversity facilitates spatio-temporal communications without requiring the deployment of physical antenna arrays. While physical layer studies on cooperativ...
164
click to vote
COORDINATION
2004
Springer
15 years 11 months ago
2004
Springer
A development environment for applications specified in an extended version of a previously developed coordination model based on associatively broadcast interactions is presented....