2703 search results - page 211 / 541 » Optimizing memory transactions |
129
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
151
Voted
PLDI
1995
ACM
15 years 7 months ago
1995
ACM
Traditional list schedulers order instructions based on an optimistic estimate of the load latency imposed by the hardware and therefore cannot respond to variations in memory lat...
121
Voted
ASPLOS
1991
ACM
15 years 7 months ago
1991
ACM
Blocking is a well-known optimization technique for improving the effectiveness of memory hierarchies. Instead of operating on entire rows or columns of an array, blocked algorith...
132
Voted
TIT
2008
15 years 3 months ago
2008
The decentralized sequential hypothesis testing problem is studied in sensor networks, where a set of sensors receive independent observations and send summary messages to the fusi...
127
Voted
DSN
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper considers the problem of electing an eventual leader in an asynchronous shared memory system. While this problem has received a lot of attention in messagepassing syste...