Sciweavers

26518 search results - page 7 / 5304
» On achieving the
Sort
View
IAT
2005
IEEE
14 years 3 months ago
Multiagent Reputation Management to Achieve Robust Software Using Redundancy
This paper explains the building of robust software using multiagent reputation. One of the major goals of software engineering is to achieve robust software. Our hypothesis is th...
Rajesh Turlapati, Michael N. Huhns
LCN
2005
IEEE
14 years 3 months ago
Achieving Scalable Capacity in Wireless Networks with Adaptive Power Control
— The seminar work of Gupta and Kumar [1] showed that multi-hop wireless networks with capacity scalable with the number of nodes, n, are achievable in theory. The transport capa...
Ivan Wang Hei Ho, Soung Chang Liew
QSHINE
2005
IEEE
14 years 3 months ago
Achieving Weighted Fairness between Uplink and Downlink in IEEE 802.11 DCF-Based WLANs
In this paper, we first propose an analytical model of WLANs (Wireless LANs) with an arbitrary backoff distribution and AIFS (Arbitration Inter-Frame Space). From the analysis, we ...
Jiwoong Jeong, Sunghyun Choi, Chong-kwon Kim
ISLPED
2000
ACM
97views Hardware» more  ISLPED 2000»
14 years 2 months ago
Achieving utility arbitrarily close to the optimal with limited energy
Energy is one of the limited resources for modern systems, especially the battery-operated devices and personal digital assistants. The backlog in new technologies for more powerf...
Gang Qu, Miodrag Potkonjak
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
13 years 11 months ago
Concatenated codes can achieve list-decoding capacity
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra