14403 search results - page 2466 / 2881 » Dynamical Systems Trees |
178
click to vote
ATAL
2003
Springer
16 years 2 days ago
2003
Springer
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...
236
click to vote
ECCV
2010
Springer
16 years 2 days ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
212
click to vote
PLDI
2010
ACM
15 years 12 months ago
2010
ACM
Multithreaded programs are notoriously prone to race conditions, a problem exacerbated by the widespread adoption of multi-core processors with complex memory models and cache coh...
168
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
—The majority of the existing ad hoc wireless network routing protocols has a tendency to use the shortest single path from the source to the destination. However, in constantly ...
153
click to vote
ISCA
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper investigates a class of main memory accesses (invalid memory traffic) that can be eliminated altogether. Invalid memory traffic is real data traffic that transfers inva...