1502 search results - page 96 / 301 » Node weighted scheduling |
ICALP
2011
Springer
13 years 1 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
PERVASIVE
2008
Springer
13 years 10 months ago
2008
Springer
In energy constrained wireless sensor networks, energy conservation techniques are to be applied in order to maximize the system lifetime. We tackle the problem of increasing netw...
CAMAD
2006
IEEE
14 years 1 months ago
2006
IEEE
Switched Processing Systems (SPS) capture the essence of a fundamental resource allocation problem in many modern communication, computer and manufacturing systems involving hetero...
ATMOS
2007
13 years 11 months ago
2007
This paper addresses the problem of generating conflict-free periodic train timetables for large railway networks. We follow a two level approach, where a simplified track topolo...
MOBIHOC
2008
ACM
14 years 9 months ago
2008
ACM
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...