Sciweavers

2796 search results - page 42 / 560
» The coolest path problem
Sort
View
EPEW
2007
Springer
15 years 6 months ago
Evaluation of P2P Search Algorithms for Discovering Trust Paths
Abstract. Distributed security models based on a ‘web of trust’ eliminate single points of failure and alleviate performance bottlenecks. However, such distributed approaches r...
Emerson Ribeiro de Mello, Aad P. A. van Moorsel, J...
ICWL
2010
Springer
14 years 9 months ago
An Open Model for Learning Path Construction
Learning path construction is a complex task. It involves formulating and organizing learning activities, defining ways to evaluate student learning progress and to match such prog...
Fan Yang, Frederick W. B. Li, Rynson W. H. Lau
WADS
2005
Springer
145views Algorithms» more  WADS 2005»
15 years 5 months ago
Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
Victor Chepoi, Bertrand Estellon, Yann Vaxè...
PODC
2003
ACM
15 years 5 months ago
Adapting to a reliable network path
We consider the model of unreliable network links, where at each time unit a link might be either up or down. We consider two related problems. The first, establishing end to end...
Baruch Awerbuch, Yishay Mansour
DAM
1998
77views more  DAM 1998»
14 years 11 months ago
Optimal Wavelength-routed Multicasting
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which c...
Bruno Beauquier, Pavol Hell, Stephane Perennes