3206 search results - page 373 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
126
Voted
PLDI
2006
ACM
15 years 8 months ago
2006
ACM
Atomic blocks allow programmers to delimit sections of code as ‘atomic’, leaving the language’s implementation to enforce atomicity. Existing work has shown how to implement...
124
click to vote
PKDD
2009
Springer
15 years 9 months ago
2009
Springer
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
158
click to vote
ICALP
1991
Springer
15 years 6 months ago
1991
Springer
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
130
Voted
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
100
Voted
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Spatially structured population models improve the performance of genetic algorithms by assisting the selection scheme in maintaining diversity. A significant concern wi...