Sciweavers

1016 search results - page 131 / 204
» Optimized algorithms for multi-agent routing
Sort
View
INFOCOM
2006
IEEE
15 years 3 months ago
Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
Michael J. Neely
ADHOC
2007
110views more  ADHOC 2007»
14 years 10 months ago
Hop count based optimization of Bluetooth scatternets
In the past five years Bluetooth scatternets were one of the most promising wireless networking technologies for ad hoc networking. In such networks, mobility together with the f...
Csaba Kiss Kallo, Carla-Fabiana Chiasserini, Sewoo...
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
15 years 10 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...
COCOON
2008
Springer
14 years 11 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi
MP
2010
119views more  MP 2010»
14 years 8 months ago
Efficient and fair routing for mesh networks
Inspired by the One Laptop Per Child project, we consider mesh networks that connect devices that cannot recharge their batteries easily. We study how the mesh should retransmit in...
Andrea Lodi, Enrico Malaguti, Nicolás E. St...