Sciweavers

150 search results - page 10 / 30
» A unifying Framework for Distributed Routing Algorithms
Sort
View
ICC
2009
IEEE
190views Communications» more  ICC 2009»
14 years 2 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...
TCS
2008
13 years 7 months ago
Using bisimulation proof techniques for the analysis of distributed abstract machines
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
Damien Pous
CVPR
2005
IEEE
14 years 9 months ago
Graph Embedding: A General Framework for Dimensionality Reduction
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
SKG
2005
IEEE
14 years 1 months ago
Improving Searching Performance Based on Semantic Correlativity in Peer to Peer Network
Most existing Peer-to-peer (P2P) systems support only title-based searches, which can not satisfy the content searches. In this paper, we proposed a semantic correlativity model wh...
Zhichao Li, Pilian He, Feng Li, Ming Lei
EUROCAST
2007
Springer
126views Hardware» more  EUROCAST 2007»
14 years 1 months ago
Parallel Tabu Search and the Multiobjective Capacitated Vehicle Routing Problem with Soft Time Windows
Abstract. In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with soft Time Windows...
Andreas Beham