2703 search results - page 509 / 541 » Optimizing memory transactions |
147
click to vote
CIKM
2011
Springer
14 years 2 months ago
2011
Springer
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
126
Voted
COMSUR
2011
14 years 2 months ago
2011
—In large networks, a data source may not reach the intended sink in a single hop, thereby requiring the traffic to be routed via multiple hops. An optimized choice of such rout...
173
click to vote
HPDC
2012
IEEE
13 years 4 months ago
2012
IEEE
Consider a multithreaded parallel application running inside a multicore virtual machine context that is itself hosted on a multi-socket multicore physical machine. How should the...
204
click to vote
PODS
2009
ACM
16 years 3 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
132
click to vote
ATAL
2009
Springer
15 years 9 months ago
2009
Springer
Distributed Constraint Optimization (DCOP) is useful for solving agent-coordination problems. Any-space DCOP search algorithms require only a small amount of memory but can be spe...