Sciweavers

1734 search results - page 116 / 347
» MSDR-D Network Localization Algorithm
Sort
View
CCR
2005
96views more  CCR 2005»
13 years 10 months ago
Stability of end-to-end algorithms for joint routing and rate control
Dynamic multi-path routing has the potential to improve the reliability and performance of a communication network, but carries a risk. Routing needs to respond quickly to achieve...
Frank P. Kelly, Thomas Voice
INFOCOM
2005
IEEE
14 years 3 months ago
A fair resource allocation algorithm for peer-to-peer overlays
— Over the past few years, Peer-to-Peer (P2P) systems have become very popular for constructing overlay networks of many nodes (peers) that allow users geographically distributed...
Yannis Drougas, Vana Kalogeraki
CONEXT
2006
ACM
14 years 4 months ago
Detail characterization of paths in pocket switched networks
Pocket Switched Networking (PSN) is a new communication paradigm between mobile devices. It takes advantage of every local communication opportunity, and the physical mobility of ...
Abderrahmen Mtibaa, Augustin Chaintreau, Christoph...
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
14 years 10 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
IPPS
2005
IEEE
14 years 3 months ago
A Distributed Chained Lin-Kernighan Algorithm for TSP Problems
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman Problems (TSP). In this paper a distributed algorithm is proposed, were nodes i...
Thomas Fischer, Peter Merz