Sciweavers

220 search results - page 40 / 44
» Minimizing Average Flow-time : Upper and Lower Bounds
Sort
View
CDC
2008
IEEE
154views Control Systems» more  CDC 2008»
14 years 1 months ago
Distributed calculation of linear functions in noisy networks via linear iterations
— Given a fixed network where each node has some given initial value, and under the constraint that each node receives noisy transmissions from its immediate neighbors, we provi...
Shreyas Sundaram, Christoforos N. Hadjicostis
SIGECOM
2006
ACM
96views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Non-cooperative multicast and facility location games
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan,...
CAGD
2010
151views more  CAGD 2010»
13 years 7 months ago
On the complexity of smooth spline surfaces from quad meshes
This paper derives strong relations that boundary curves of a smooth complex of patches have to obey when the patches are computed by local averaging. These relations restrict the...
Jörg Peters, Jianhua Fan
CN
2006
82views more  CN 2006»
13 years 7 months ago
A cost-minimization algorithm for fast location tracking in mobile wireless networks
Location tracking is one of the most important issues in providing real-time applications over wireless networks due to its effect to quality of service (QoS), such as end-to-end ...
Wenye Wang, Guoliang Xue
DLOG
2010
13 years 5 months ago
Optimizing Algebraic Tableau Reasoning for SHOQ: First Experimental Results
In this paper we outline an algebraic tableau algorithm for the DL SHOQ, which supports more informed reasoning due to the use of semantic partitioning and integer programming. We ...
Jocelyne Faddoul, Volker Haarslev