Sciweavers

36887 search results - page 27 / 7378
» Are We All In the Same
Sort
View
EUROPAR
2007
Springer
14 years 1 months ago
Distributed Computation of All Node Replacements of a Minimum Spanning Tree
In many network applications the computation takes place on the minimum-cost spanning tree (MST) of the network; unfortunately, a single link or node failure disconnects the tree. ...
Paola Flocchini, Toni Mesa Enriquez, Linda Pagli, ...
HICSS
2007
IEEE
84views Biometrics» more  HICSS 2007»
14 years 3 months ago
It's All News to Me: The Effect of Instruments on Ratings Provision
In this paper, we address an issue of design in online rating systems: how many items should be elicited from the ratings provider. Recommender and reputation systems have traditi...
Cliff Lampe, R. Kelly Garrett
ERLANG
2003
ACM
14 years 2 months ago
All you wanted to know about the HiPE compiler: (but might have been afraid to ask)
We present a user-oriented description of features and characteristics of the High Performance Erlang (HiPE) native code compiler, which nowadays is part of Erlang/OTP. In particu...
Konstantinos F. Sagonas, Mikael Pettersson, Richar...
APPROX
1998
Springer
150views Algorithms» more  APPROX 1998»
14 years 1 months ago
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
Vijay Kumar
INFOCOM
1995
IEEE
14 years 21 days ago
Models of Blocking Probability in All-Optical Networks with and without Wavelength Changers
We introduce a traffic model for circuit-switched all-optical networks which we then use to calculate the blocking probability along a path for networks with and without wavelength...
Richard A. Barry, Pierre A. Humblet