Sciweavers

29082 search results - page 258 / 5817
» The Time-Triggered Model of Computation
Sort
View
PPOPP
2012
ACM
14 years 2 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
BIRTHDAY
2010
Springer
15 years 3 months ago
QPME 2.0 - A Tool for Stochastic Modeling and Analysis Using Queueing Petri Nets
Abstract Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the model...
Samuel Kounev, Simon Spinner, Philipp Meier
ACL
2012
13 years 9 months ago
Authorship Attribution with Author-aware Topic Models
Authorship attribution deals with identifying the authors of anonymous texts. Building on our earlier finding that the Latent Dirichlet Allocation (LDA) topic model can be used t...
Yanir Seroussi, Fabian Bohnert, Ingrid Zukerman
SPAA
2006
ACM
16 years 16 days ago
Symmetric network computation
We introduce a simple new model of distributed computation — finite-state symmetric graph automata (FSSGA) — which captures the qualitative properties common to fault-toleran...
David Pritchard, Santosh Vempala
ICMAS
2000
15 years 8 months ago
Computationally Grounded Theories of Agency
In this paper, I motivate, define, and illustrate the notion of computationally grounded theories of agency. A theory of agency is said to be computationally grounded if we can gi...
Michael Wooldridge