Sciweavers

2421 search results - page 221 / 485
» Approximate Flow-Aware Networking
Sort
View
AAAI
1992
15 years 5 months ago
On the Minimality and Decomposability of Constraint Networks
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
Peter van Beek
QUESTA
2006
101views more  QUESTA 2006»
15 years 3 months ago
Insensitive versus efficient dynamic load balancing in networks without blocking
So-called Whittle networks have recently been shown to give tight approximations for the performance of non-locally balanced networks with blocking, including practical routing pol...
Matthieu Jonckheere
TCOM
2008
98views more  TCOM 2008»
15 years 3 months ago
Performance evaluation of multi-hop CSMA/CA networks in fading environments
The performance of multi-hop CSMA/CA networks has in most cases been evaluated via simulations, or analytically using a perfect collision channel model. Using such methods, one ca...
Duong A. Hoang, Ronald A. Iltis
INFOCOM
2005
IEEE
15 years 9 months ago
Power aware routing for sensor databases
— Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensor network databases like TinyDB [1] are the dominant architectures...
Chiranjeeb Buragohain, Divyakant Agrawal, Subhash ...
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
15 years 10 months ago
Doing Good with Spam Is Hard
We study economic means to improve network performance in the well-known game theoretic traffic model due to Wardrop. We introduce two sorts of spam flow - auxiliary and adversari...
Martin Hoefer, Lars Olbrich, Alexander Skopalik