Sciweavers

6897 search results - page 1325 / 1380
» Parallelization of Modular Algorithms
Sort
View
ICALP
1992
Springer
15 years 6 months ago
Near-perfect Token Distribution
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli ...
CASC
2006
Springer
128views Mathematics» more  CASC 2006»
15 years 5 months ago
New Domains for Applied Quantifier Elimination
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
Thomas Sturm
PLDI
1995
ACM
15 years 5 months ago
Unifying Data and Control Transformations for Distributed Shared Memory Machines
We present a unified approach to locality optimization that employs both data and control transformations. Data transformations include changing the array layout in memory. Contr...
Michal Cierniak, Wei Li
AAAI
2008
15 years 4 months ago
Resource Constrained Distributed Constraint Optimization with Virtual Variables
Cooperative problem solving with resource constraints are important in practical multi-agent systems. Resource constraints are necessary to handle practical problems including dis...
Toshihiro Matsui, Hiroshi Matsuo, Marius Silaghi, ...
ASMTA
2008
Springer
167views Mathematics» more  ASMTA 2008»
15 years 4 months ago
Perfect Simulation of Stochastic Automata Networks
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...
Paulo Fernandes, Jean-Marc Vincent, Thais Webber
« Prev « First page 1325 / 1380 Last » Next »