2446 search results - page 99 / 490 » Choiceless Polynomial Time |
102
click to vote
IPL
2010
14 years 11 months ago
2010
We deal with the problem of deciding whether a given set of string patterns implies the presence of a fixed pattern. While checking whether a set of patterns occurs in a string i...
112
click to vote
ICPP
2006
IEEE
15 years 6 months ago
2006
IEEE
Modeling the performance behavior of parallel applications to predict the execution times of the applications for larger problem sizes and number of processors has been an active ...
116
Voted
SODA
2003
ACM
15 years 2 months ago
2003
ACM
In this paper we present a simple deterministic algorithm for testing whether a multivariate polynomial f(x1, . . . , xn) is identically zero, in time polynomial in m, n, log(d + ...
108
click to vote
CATS
2006
15 years 2 months ago
2006
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
118
Voted
AIPS
2011
14 years 4 months ago
2011
Most predominant approaches in probabilistic planning utilize techniques from the more thoroughly investigated field of classical planning by determinizing the problem at hand. I...