3082 search results - page 246 / 617 » New Bounds for the Controller Problem |
224
click to vote
ICFEM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
179
click to vote
ICMCS
1994
IEEE
15 years 10 months ago
1994
IEEE
Network-based real-time multimedia applications require guaranteed performance communicationservices. To provide guaranteed service, resources have to be reserved within the netwo...
140
click to vote
ISAAC
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
184
click to vote
IJCAI
2007
15 years 8 months ago
2007
We introduce a new technique for counting models of Boolean satisfiability problems. Our approach incorporates information obtained from sampling the solution space. Unlike previ...
167
click to vote
NIPS
2004
15 years 8 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...