Sciweavers

258 search results - page 50 / 52
» Non-cooperative routing in loss networks
Sort
View
INFOCOM
2003
IEEE
14 years 28 days ago
Flow Level Simulation of Large IP Networks
— The aim of this paper is to simulate the interaction of a large number of TCP controlled flows and UDP flows sharing many routers/links, from the knowledge of the network par...
François Baccelli, Dohy Hong
INFOCOM
2010
IEEE
13 years 6 months ago
Adaptive Calibration for Fusion-based Wireless Sensor Networks
Abstract—Wireless sensor networks (WSNs) are typically composed of low-cost sensors that are deeply integrated with physical environments. As a result, the sensing performance of...
Rui Tan, Guoliang Xing, Xue Liu, Jianguo Yao, Zhao...
GLOBECOM
2008
IEEE
14 years 2 months ago
Optimal Location Updates in Mobile Ad Hoc Networks: A Separable Cost Case
Abstract—We consider the location service in a mobile adhoc network (MANET), where each node needs to maintain its location information in the network by (i) frequently updating ...
Zhenzhen Ye, Alhussein A. Abouzeid
SIGECOM
2006
ACM
88views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Implementation with a bounded action space
While traditional mechanism design typically assumes isomorphism between the agents’ type- and action spaces, in many situations the agents face strict restrictions on their act...
Liad Blumrosen, Michal Feldman
FPGA
2003
ACM
154views FPGA» more  FPGA 2003»
14 years 26 days ago
Parallel placement for field-programmable gate arrays
Placement and routing are the most time-consuming processes in automatically synthesizing and configuring circuits for field-programmable gate arrays (FPGAs). In this paper, we ...
Pak K. Chan, Martine D. F. Schlag