Sciweavers

702 search results - page 109 / 141
» Algorithms for Minimizing Response Time in Broadcast Schedul...
Sort
View
EMSOFT
2009
Springer
15 years 10 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
16 years 17 days ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
MOBICOM
2000
ACM
15 years 10 months ago
Pushing dependent data in clients-providers-servers systems
In satellite and wireless networks and in advanced traffic information systems in which the up-link bandwidth is very limited, a server broadcasts data files in a round-robin man...
Amotz Bar-Noy, Joseph Naor, Baruch Schieber
TMC
2010
167views more  TMC 2010»
15 years 22 days ago
Optimal Speed Control of Mobile Node for Data Collection in Sensor Networks
A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the prox...
Ryo Sugihara, Rajesh K. Gupta
ICALP
2005
Springer
15 years 11 months ago
Approximation Algorithms for the Max-coloring Problem
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
Sriram V. Pemmaraju, Rajiv Raman