Sciweavers

29 search results - page 3 / 6
» Provably competitive adaptive routing
Sort
View
LR
2011
156views more  LR 2011»
12 years 11 months ago
The assessment of competitive intensity in logistics markets
Scopus is the world’s largest abstract and citation database of peer-reviewed literature and quality web sources (-> http://www.info.sciverse.com/scopus). ontains 41 million r...
Peter Klaus
ICRA
2005
IEEE
120views Robotics» more  ICRA 2005»
13 years 10 months ago
Hybrid PRM Sampling with a Cost-Sensitive Adaptive Strategy
— A number of advanced sampling strategies have been proposed in recent years to address the narrow passage problem for probabilistic roadmap (PRM) planning. These sampling strat...
David Hsu, Gildardo Sánchez-Ante, Zheng Sun
IPPS
1998
IEEE
13 years 9 months ago
Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations
A unicast-based multicasting algorithm is presented for arbitrary interconnection networks arising in switchbased networks of workstations. The algorithm is optimal with respect t...
Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Raja...
GECCO
2008
Springer
146views Optimization» more  GECCO 2008»
13 years 5 months ago
A formal performance modeling framework for bio-inspired ad hoc routing protocols
Bio-inspired ad hoc routing is an active area of research. The designers of these algorithms predominantly evaluate the performance of their protocols with the help of simulation ...
Muhammad Saleem, Syed Ali Khayam, Muddassar Farooq
ALT
2009
Springer
14 years 1 months ago
Learning Unknown Graphs
Motivated by a problem of targeted advertising in social networks, we introduce and study a new model of online learning on labeled graphs where the graph is initially unknown and...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...