Sciweavers

2100 search results - page 53 / 420
» Fundamentals of the problem
Sort
View
INFOCOM
2010
IEEE
13 years 8 months ago
INPAC: An Enforceable Incentive Scheme for Wireless Networks using Network Coding
—Wireless mesh networks have been widely deployed to provide broadband network access, and their performance can be significantly improved by using a new technology called netwo...
Tingting Chen, Sheng Zhong
AAAI
2010
13 years 11 months ago
Dominance Testing via Model Checking
Dominance testing, the problem of determining whether an outcome is preferred over another, is of fundamental importance in many applications. Hence, there is a need for algorithm...
Ganesh Ram Santhanam, Samik Basu, Vasant Honavar
HYBRID
2003
Springer
14 years 3 months ago
Universality and Language Inclusion for Open and Closed Timed Automata
The algorithmic analysis of timed automata is fundamentally limited by the undecidability of the universality problem. For this reason and others, there has been considerable inter...
Joël Ouaknine, James Worrell
INFOCOM
2008
IEEE
14 years 4 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
TON
2002
123views more  TON 2002»
13 years 9 months ago
Utility-based rate control in the Internet for elastic traffic
In a communication network, a good rate allocation algorithm should reflect the utilities of the users while being fair. We investigate this fundamental problem of achieving the sy...
Richard J. La, Venkat Anantharam