12052 search results - page 429 / 2411 » computing 2010 |
152
click to vote
CONCUR
2010
Springer
15 years 8 months ago
2010
Springer
Fixed point logics are widely used in computer science, in particular in artificial intelligence and concurrency. The most expressive logics of this type are the
174
click to vote
PROCEDIA
2010
15 years 5 months ago
2010
We consider the numerical computation of stationary distributions for level dependent quasi-birth-and-death processes. An algorithm based on matrix continued fractions is presente...
174
click to vote
JSAT
2010
15 years 1 months ago
2010
Groote and Zantema proved that a particular OBDD computation of the pigeonhole formula has exponential size, and that limited OBDD derivations cannot simulate resolution polynomia...
157
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
Coalitions and cooperation are key topics in multi
148
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We present an algorithm for computing directly the denotation of a modal