258 search results - page 20 / 52 » Weak Bisimulation Approximants |
FSTTCS
2006
Springer
15 years 3 months ago
2006
Springer
We propose a new approach to verification of probabilistic processes for which the model may not be available. We use a technique from Reinforcement Learning to approximate how far...
IJCAI
2001
15 years 1 months ago
2001
This paper describes an algorithm for solving large state-space MDPs (represented as factored MDPs) using search by successive refinement in the space of non-homogeneous partition...
JCO
2008
14 years 11 months ago
2008
In this paper we present two main results about the inapproximability of the exemplar conserved interval distance problem of genomes. First, we prove that it is NP-complete to deci...
WINE
2005
Springer
15 years 5 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
104
click to vote
MOC
2010
14 years 6 months ago
2010
Weak solutions for nonlinear wave equations involving the p(x)-Laplacian, for p : (1, ) are constructed as appropriate limits of solutions of an implicit finite element discretiz...