Sciweavers

1153 search results - page 189 / 231
» The Complexity of Revision, Revised
Sort
View
JOLLI
2008
145views more  JOLLI 2008»
13 years 8 months ago
Temporal Languages for Epistemic Programs
This paper adds temporal logic to public announcement logic (PAL) and dynamic epistemic logic (DEL). By adding a previous-time operator to PAL, we express in the language statemen...
Joshua Sack
JCSS
2006
56views more  JCSS 2006»
13 years 8 months ago
Determining model accuracy of network traces
Accurate network modeling is critical to the design of network protocols. Traditional modeling approaches, such as Discrete Time Markov Chains (DTMC) are limited in their ability ...
Almudena Konrad, Ben Y. Zhao, Anthony D. Joseph
ECCC
2007
100views more  ECCC 2007»
13 years 8 months ago
Unconditional pseudorandom generators for low degree polynomials
Abstract: We give an explicit construction of a pseudorandom generator against lowdegree polynomials over finite fields. Pseudorandom generators against linear polynomials, known...
Shachar Lovett
KES
2008
Springer
13 years 8 months ago
Driven by Compression Progress
I argue that data becomes temporarily interesting by itself to some self-improving, but computationally limited, subjective observer once he learns to predict or compress the data...
Jürgen Schmidhuber
MOR
2008
87views more  MOR 2008»
13 years 8 months ago
On Near Optimality of the Set of Finite-State Controllers for Average Cost POMDP
We consider the average cost problem for partially observable Markov decision processes (POMDP) with finite state, observation, and control spaces. We prove that there exists an -...
Huizhen Yu, Dimitri P. Bertsekas