1074 search results - page 116 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
146
Voted
GRID
2006
Springer
15 years 3 months ago
2006
Springer
Abstract Parallel asynchronous iterative algorithms relax synchronization and communication requirements, and can potentially extend Desktop Grids beyond embarrassingly parallel ap...
132
Voted
JCSS
2007
15 years 3 months ago
2007
In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks. Each task ...
122
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
In probabilistic grammatical inference, a usual goal is to infer a good approximation of an unknown distribution P called a stochastic language. The estimate of P stands in some cl...
169
Voted
PAMI
2011
14 years 10 months ago
2011
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
150
click to vote
ALT
2003
Springer
16 years 12 days ago
2003
Springer
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...