19866 search results - page 137 / 3974 » Computing all factorizations in *** |
172
click to vote
AMAI
2006
Springer
15 years 6 months ago
2006
Springer
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
211
click to vote
GROUP
2010
ACM
15 years 4 months ago
2010
ACM
Online creative collaboration (peer production) has enabled the creation of Wikipedia and open source software (OSS), and is rapidly expanding to encompass new domains, such as vi...
201
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
Transcriptional regulation is accomplished by several transcription factor proteins that bind to specific DNA elements in the relative vicinity of the gene, and interact with each ...
187
click to vote
PKC
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
133
click to vote
EOR
2006
15 years 6 months ago
2006
We introduce the two-stage stochastic maximum-weight matching problem and demonstrate that this problem is NP-complete. We give a factor 1 2 approximation algorithm and prove its ...