3206 search results - page 241 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
149
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
169
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
135
Voted
PDCAT
2005
Springer
15 years 9 months ago
2005
Springer
View-Oriented Parallel Programming is based on Distributed Shared Memory which is friendly and easy for programmers to use. It requires the programmer to divide shared data into v...
146
Voted
GECCO
2011
Springer
14 years 7 months ago
2011
Springer
Novelty search is a recently proposed method for evolutionary computation designed to avoid the problem of deception, in which the fitness function guides the search process away...
126
Voted
ISCA
1996
IEEE
15 years 8 months ago
1996
IEEE
Historically, processor accesses to memory-mapped device registers have been marked uncachable to insure their visibility to the device. The ubiquity of snooping cache coherence, ...