2485 search results - page 171 / 497 » Time Bounded Frequency Computations |
176
click to vote
CONCUR
2001
Springer
15 years 10 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 ...
161
click to vote
APPROX
2009
Springer
16 years 26 days ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
165
Voted
ISSAC
2005
Springer
15 years 11 months ago
2005
Springer
Let A and B be two polynomials in [x,y] and let R = resx(A, B) denote the resultant of A and B taken wrt x. In this paper we modify Collins’ modular algorithm for computing R...
134
click to vote
FOCS
1997
IEEE
15 years 10 months ago
1997
IEEE
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
158
click to vote
SIROCCO
2000
15 years 7 months ago
2000
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...