Sciweavers

422 search results - page 51 / 85
» Shortest paths between shortest paths and independent sets
Sort
View
CONEXT
2007
ACM
14 years 18 days ago
Exploring the routing complexity of mobile multicast: a semi-empirical study
Protocol extensions for a mobile Internet have been developed within the IETF, but a standard design of mobile multicast is still awaited. Multicast routing, when adapting its dis...
Matthias Wählisch, Thomas C. Schmidt
ADHOC
2007
159views more  ADHOC 2007»
13 years 8 months ago
Cross-layer adaptive control for wireless mesh networks
Abstract— This paper investigates optimal routing and adaptive scheduling in a wireless mesh network composed of mesh clients and mesh routers. The mesh clients are power constra...
Michael J. Neely, Rahul Urgaonkar
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
14 years 3 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
NOMS
2006
IEEE
14 years 2 months ago
An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem
— Open Shortest Path First (OSPF) is a routing protocol which is widely used in the Industry. Its functionality mainly depends on the weights assigned to the links. Given the tra...
Mohammed H. Sqalli, Sadiq M. Sait, Mohammed Aijaz ...
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 3 months ago
Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
Yi Gai, Bhaskar Krishnamachari, Rahul Jain