1120 search results - page 4 / 224 » Parallel Algorithmic Techniques for Combinatorial Computatio... |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
RANDOM
2001
Springer
14 years 5 days ago
2001
Springer
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
WAE
2001
13 years 9 months ago
2001
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...