15073 search results - page 17 / 3015 » Probabilistic algorithms for computing resultants |
CONCUR
2001
Springer
15 years 2 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
73
Voted
ICDCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Self-stabilization is a strong property which guarantees that a network always resume a correct behavior starting from an arbitrary initial state. Weaker guarantees have later bee...
JSC
2007
14 years 9 months ago
2007
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line pro...
166
click to vote
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank...
UAI
2008
14 years 11 months ago
2008
While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact comput...