774 search results - page 115 / 155 » A New Graph Triconnectivity Algorithm and Its Parallelizatio... |
ICML
2006
IEEE
14 years 9 months ago
2006
IEEE
For a Markov Decision Process with finite state (size S) and action spaces (size A per state), we propose a new algorithm--Delayed Q-Learning. We prove it is PAC, achieving near o...
IPPS
2006
IEEE
14 years 3 months ago
2006
IEEE
The increasing availability of high-performance computing systems with thousands, tens of thousands, and even hundreds of thousands of computational nodes is driving the demand fo...
EUROPAR
2000
Springer
14 years 17 days ago
2000
Springer
Abstract. Definitions for the uniform representation of d-dimensional matrices serially in Morton-order (or Z-order) support both their use with cartesian indices, and their divide...
OPODIS
2010
13 years 6 months ago
2010
Abstract. Small-world networks are currently present in many distributed applications and can be built augmenting a base network with long-range links using a probability distribut...
JSA
2000
13 years 8 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...