66 search results - page 11 / 14 » A Game-Theoretic Approach to Routing under Adversarial Condi... |
166
click to vote
CCGRID
2007
IEEE
16 years 10 days 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,...
155
click to vote
ISPD
2010
ACM
16 years 26 days 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...
154
click to vote
ISSRE
2005
IEEE
15 years 11 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...
166
click to vote
NCA
2007
IEEE
16 years 8 days 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...
221
click to vote
SECPERU
2006
IEEE
16 years 14 hour 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...