66 search results - page 11 / 14 » A Game-Theoretic Approach to Routing under Adversarial Condi... |
CCGRID
2007
IEEE
14 years 1 months ago
2007
IEEE
The number of processors embedded on high performance computing platforms is continuously increasing to accommodate user desire to solve larger and more complex problems. However,...
ISPD
2010
ACM
14 years 2 months ago
2010
ACM
This paper presents SafeChoice (SC), a novel clustering algorithm for wirelength-driven placement. Unlike all previous approaches, SC is proposed based on a fundamental theorem, s...
ISSRE
2005
IEEE
14 years 1 months ago
2005
IEEE
In wireless sensor networks, to obtain reliability and minimize energy consumption, a dynamic rate-control and congestion-avoidance transport scheme is very important. We notice t...
NCA
2007
IEEE
14 years 1 months ago
2007
IEEE
Developing middleware services for dynamic distributed systems, e.g., ad-hoc networks, is a challenging task given that such services deal with dynamically changing membership and...
SECPERU
2006
IEEE
14 years 1 months ago
2006
IEEE
Ad hoc routing protocols have been designed to efficiently reroute traffic when confronted with network congestion, faulty nodes, and dynamically changing topologies. The common d...