Sciweavers

3192 search results - page 369 / 639
» The minimum latency problem
Sort
View
ALGORITHMICA
2006
138views more  ALGORITHMICA 2006»
15 years 4 months ago
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
ENTCS
2008
115views more  ENTCS 2008»
15 years 4 months ago
Time Separation of Events: An Inverse Method
The problem of "time separation" can be stated as follows: Given a system made of several connected components, each one entailing a local delay known with uncertainty, ...
Emmanuelle Encrenaz, Laurent Fribourg
COR
2007
143views more  COR 2007»
15 years 4 months ago
Discrete bandwidth allocation considering fairness and transmission load in multicast networks
As a promising solution to tackle the network heterogeneity in multicasting, layered multicast protocols such as Receiver-driven layered multicast (RLM) and Layered video multicas...
Chae Y. Lee, Hee K. Cho
CORR
2007
Springer
129views Education» more  CORR 2007»
15 years 4 months ago
A Rank-Metric Approach to Error Control in Random Network Coding
It is shown that the error control problem in random network coding can be reformulated as a generalized decoding problem for rank-metric codes. This result allows many of the too...
Danilo Silva, Frank R. Kschischang, Ralf Koetter
JUCS
2008
150views more  JUCS 2008»
15 years 4 months ago
Optimal Sensor Network Layout Using Multi-Objective Metaheuristics
: Wireless Sensor Networks (WSN) allow, thanks to the use of small wireless devices known as sensor nodes, the monitorization of wide and remote areas with precision and liveness u...
Guillermo Molina, Enrique Alba, El-Ghazali Talbi