544 search results - page 34 / 109 » What cannot be computed locally! |
UAI
2008
13 years 10 months ago
2008
We conjecture that the worst case number of experiments necessary and sufficient to discover a causal graph uniquely given its observational Markov equivalence class can be specif...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a w...
LICS
2009
IEEE
14 years 3 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
AIS
2010
Springer
13 years 8 months ago
2010
Springer
If complexity is a necessary but not sufficient premise for the existence and expression of the living, anticipation is the distinguishing characteristic of what is alive. Anticipa...
FORTE
2004
13 years 10 months ago
2004
Internet software tightly integrates classic computation with communication software. Heterogeneity and complexity can be tackled with a component-based approach, where components ...