Sciweavers

10901 search results - page 1740 / 2181
» Approximations in Distributed Optimization
Sort
View
CORR
2006
Springer
110views Education» more  CORR 2006»
15 years 7 months ago
Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds...
Christophe Cérin, Jean-Christophe Dubacq, J...
DC
2006
15 years 7 months ago
Performing work in broadcast networks
We consider the problem of how to schedule t similar and independent tasks to be performed in a synchronous distributed system of p stations communicating via multiple-access chan...
Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Li...
IBMSJ
2006
96views more  IBMSJ 2006»
15 years 7 months ago
Running Quake II on a grid
ed underlying grid infrastructure to an application) allowed us to reuse an existing game engine without the need to make any significant changes to it. In this paper we examine th...
Glenn Deen, Matthew Hammer, John Bethencourt, Iris...
IJAR
2006
89views more  IJAR 2006»
15 years 7 months ago
Learning probabilistic decision graphs
Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence...
Manfred Jaeger, Jens D. Nielsen, Tomi Silander
IJFCS
2006
82views more  IJFCS 2006»
15 years 7 months ago
Routing Multiple Width Communications on the Circuit Switched Tree
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such ar...
Krishnendu Roy, Ramachandran Vaidyanathan, Jerry L...
« Prev « First page 1740 / 2181 Last » Next »