Sciweavers

ACRI
2010
Springer
13 years 8 months ago
Using Cellular Automata on a Graph to Model the Exchanges of Cash and Goods
This paper investigates the behaviors and the properties of a "Give and Take" cellular automaton on a graph. Using an economical metaphor, this model implements the excha...
Ranaivo Mahaleo Razakanirina, Bastien Chopard
AMAI
2005
Springer
13 years 11 months ago
Toward leaner binary-clause reasoning in a satisfiability solver
Binary-clause reasoning has been shown to reduce the size of the search space on many satisfiability problems, but has often been so expensive that run-time was higher than that o...
Allen Van Gelder
IPPS
2000
IEEE
14 years 3 months ago
On Identifying Strongly Connected Components in Parallel
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
Lisa Fleischer, Bruce Hendrickson, Ali Pinar
IICS
2005
Springer
14 years 5 months ago
Distributed Calculation of PageRank Using Strongly Connected Components
We provide an approach to distribute the calculation of PageRank, by splitting the graph into its strongly connected components. As we prove, the global ranking may be calculated c...
Michael Brinkmeier