Sciweavers

736 search results - page 89 / 148
» Approximating the Number of Network Motifs
Sort
View
P2P
2006
IEEE
101views Communications» more  P2P 2006»
15 years 4 months ago
Reinforcement Learning for Query-Oriented Routing Indices in Unstructured Peer-to-Peer Networks
The idea of building query-oriented routing indices has changed the way of improving routing efficiency from the basis as it can learn the content distribution during the query r...
Cong Shi, Shicong Meng, Yuanjie Liu, Dingyi Han, Y...
CAAN
2004
Springer
15 years 3 months ago
Bandwidth Allocation in Networks: A Single Dual Update Subroutine for Multiple Objectives
We study the bandwidth allocation problem Maximize U(x), subject to Ax ≤ c; x ≥ 0 where U is a utility function, x is a bandwidth allocation vector, and Ax ≤ c represent the...
Sung-woo Cho, Ashish Goel
INFOCOM
2003
IEEE
15 years 3 months ago
Heavy tailed M/G/1-PS queues with impatience and admission control in packet networks
Abstract—In this paper we analyze the M/G/1 processor sharing queue with heavy tailed services and with impatient customers. It is assumed that impatience depends on the value of...
Jacqueline Boyer, Fabrice Guillemin, Philippe Robe...
TCS
2008
14 years 10 months ago
Minimum-Energy Broadcast and disk cover in grid wireless networks
The Minimum-Energy Broadcast problem is to assign a transmission range to every station of an ad-hoc wireless networks so that (i) a given source station is allowed to perform bro...
Tiziana Calamoneri, Andrea E. F. Clementi, Miriam ...
CDC
2010
IEEE
137views Control Systems» more  CDC 2010»
14 years 5 months ago
Control of large 1D networks of double integrator agents: Role of heterogeneity and asymmetry on stability margin
We consider the distributed control of a network of heterogeneous agents with double integrator dynamics to maintain a rigid formation in 1D. The control signal at a vehicle is all...
He Hao, Prabir Barooah