Sciweavers

2354 search results - page 49 / 471
» A Common-Sense Theory of Time
Sort
View
CSL
2010
Springer
13 years 8 months ago
Randomisation and Derandomisation in Descriptive Complexity Theory
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
Kord Eickmeyer, Martin Grohe
DAM
2008
88views more  DAM 2008»
13 years 8 months ago
Stochastic applications of media theory: Random walks on weak orders or partial orders
This paper presents the axioms of a real time random walk on the set of states of a medium and some of their consequences, such as the asymptotic probabilities of the states. The ...
Jean-Claude Falmagne, Yung-Fong Hsu, Fabio Leite, ...
CORR
2004
Springer
191views Education» more  CORR 2004»
13 years 7 months ago
Artificial Intelligence and Systems Theory: Applied to Cooperative Robots
- This paper describes an approach to the design of a population of cooperative robots based on concepts borrowed from Systems Theory and Artificial Intelligence The research has b...
Pedro U. Lima, Luís M. M. Custódio
CORR
2000
Springer
91views Education» more  CORR 2000»
13 years 7 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber
TPDS
2010
135views more  TPDS 2010»
13 years 6 months ago
Maximizing Service Reliability in Distributed Computing Systems with Random Node Failures: Theory and Implementation
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
Jorge E. Pezoa, Sagar Dhakal, Majeed M. Hayat