Sciweavers

1502 search results - page 79 / 301
» Node weighted scheduling
Sort
View
NETWORKS
2010
13 years 8 months ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum
ICAS
2005
IEEE
87views Robotics» more  ICAS 2005»
14 years 3 months ago
RTnet: a distributed real-time protocol for broadcast-capable networks
RTnet is a distributed real-time network protocol, to be used on fully-connected local area networks with a broadcast capability. It supports on-the-fly addition and removal of n...
Ferdy Hanssen, Pierre G. Jansen, Hans Scholten, Sa...
CN
2008
118views more  CN 2008»
13 years 10 months ago
Modeling and computing throughput capacity of wireless multihop networks
Capacity is an important property for QoS support in Mobile Ad Hoc Networks (MANETs) and has been extensively studied. However, most approaches rely on simplified models (e.g., pr...
Patrick Stuedi, Gustavo Alonso
CORR
2010
Springer
75views Education» more  CORR 2010»
13 years 5 months ago
Treemaps with Bounded Aspect Ratio
Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree T where the weight of each node is the sum of the weights of its children. A treemap ...
Mark de Berg, Bettina Speckmann, Vincent van der W...
CN
2006
99views more  CN 2006»
13 years 10 months ago
High-performance switching based on buffered crossbar fabrics
As buffer-less crossbar scheduling algorithms reach their practical limitations due to higher port numbers and data rates, internally buffered crossbar (IBC) switches have gained ...
Lotfi Mhamdi, Mounir Hamdi, Christopher Kachris, S...