Sciweavers

1768 search results - page 171 / 354
» Optimal routing in Chord
Sort
View
MOBICOM
2003
ACM
15 years 6 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
SAGT
2009
Springer
192views Game Theory» more  SAGT 2009»
15 years 8 months ago
Learning and Approximating the Optimal Strategy to Commit To
Computing optimal Stackelberg strategies in general two-player Bayesian games (not to be confused with Stackelberg strategies in routing games) is a topic that has recently been ga...
Joshua Letchford, Vincent Conitzer, Kamesh Munagal...
FCCM
2006
IEEE
162views VLSI» more  FCCM 2006»
15 years 7 months ago
Power Visualization, Analysis, and Optimization Tools for FPGAs
This paper introduces the Low-Power Intelligent Tool Environment (LITE), an object oriented tool set designed for power visualization, analysis, and optimization. These tools lever...
Matthew French, Li Wang, Michael J. Wirthlin
MP
2010
116views more  MP 2010»
14 years 11 months ago
New techniques for cost sharing in combinatorial optimization games
Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for...
Alberto Caprara, Adam N. Letchford
ICASSP
2009
IEEE
15 years 8 months ago
Cross-layer optimization of wireless fading ad-hoc networks
This paper introduces an algorithm to approximately find optimal wireless networks in presence of fading. Joint optimization of application level rates, routes, link capacities, ...
Nikolaos Gatsis, Alejandro Ribeiro, Georgios B. Gi...