5630 search results - page 1001 / 1126 » Computability in Specification |
144
click to vote
AIPS
2009
15 years 5 months ago
2009
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
167
click to vote
BIRTHDAY
2010
Springer
15 years 5 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
133
click to vote
BIRTHDAY
2010
Springer
15 years 5 months ago
2010
Springer
One of the obstacles in automatic program proving is to obtain suitable loop invariants. The invariant of a loop is a weakened form of its postcondition (the loop's goal, als...
120
click to vote
CONCUR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
164
click to vote
CONEXT
2009
ACM
15 years 5 months ago
2009
ACM
We consider the problem of traffic management in small networks with both wireless and wired devices, connected to the Internet through a single gateway. Examples of such networks...