2168 search results - page 312 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
144
Voted
ICPP
2007
IEEE
15 years 10 months ago
2007
IEEE
As the number of computing and storage nodes keeps increasing, the interconnection network is becoming a key element of many computing and communication systems, where the overall...
170
Voted
MOBIHOC
2003
ACM
16 years 3 months ago
2003
ACM
A central challenge in ad hoc networks is the design of routing protocols that can adapt their behavior to frequent and rapid changes in the network. The performance of proactive ...
160
click to vote
WSDM
2010
ACM
16 years 1 months ago
2010
ACM
Knowledge-sharing communities like Wikipedia and automated extraction methods like those of DBpedia enable the construction of large machine-processible knowledge bases with relat...
133
Voted
ICS
2007
Tsinghua U.
15 years 10 months ago
2007
Tsinghua U.
Sensitivity Analysis (SA) is a novel compiler technique that complements, and integrates with, static automatic parallelization analysis for the cases when relevant program behavi...
136
click to vote
IPSN
2004
Springer
15 years 9 months ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...