Sciweavers

2283 search results - page 232 / 457
» Bounds of Graph Characteristics
Sort
View
151
Voted
DAC
2007
ACM
16 years 4 months ago
Multiprocessor Resource Allocation for Throughput-Constrained Synchronous Dataflow Graphs
Abstract. Embedded multimedia systems often run multiple time-constrained applications simultaneously. These systems use multiprocessor systems-on-chip of which it must be guarante...
Sander Stuijk, Twan Basten, Marc Geilen, Henk Corp...
130
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
Guang Tan, Marin Bertier, Anne-Marie Kermarrec
104
Voted
MFCS
2009
Springer
15 years 10 months ago
Balanced Paths in Colored Graphs
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
Alessandro Bianco, Marco Faella, Fabio Mogavero, A...
168
Voted
AAIM
2007
Springer
188views Algorithms» more  AAIM 2007»
15 years 9 months ago
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirot...
111
Voted
WDAG
2007
Springer
105views Algorithms» more  WDAG 2007»
15 years 9 months ago
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
Jérémie Chalopin, Shantanu Das, Nico...