2485 search results - page 228 / 497 » Time Bounded Frequency Computations |
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...
227
click to vote
CSL
2007
Springer
16 years 23 days ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
204
click to vote
AI
1999
Springer
15 years 6 months ago
1999
Springer
Coalition formation is a key topic in multiagent systems. One may prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coal...
158
click to vote
CGO
2006
IEEE
15 years 10 months ago
2006
IEEE
Modern computer systems are called on to deal with billions of events every second, whether they are instructions executed, memory locations accessed, or packets forwarded. This p...
181
click to vote
WABI
2009
Springer
16 years 1 months ago
2009
Springer
We present a novel dynamic programming framework that allows one to compute tight upper bounds for the p-values of gapped local alignments in pseudo–polynomial time. Our algorith...