1127 search results - page 54 / 226 » Theory Extension in ACL2(r) |
105
click to vote
APN
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We study probabilistic safe Petri nets, a probabilistic extension of safe Petri nets interpreted under the true-concurrent semantics. In particular, the likelihood of pro...
113
click to vote
SOFSEM
2010
Springer
15 years 9 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
124
click to vote
LATA
2009
Springer
15 years 7 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
117
Voted
SIGIR
2011
ACM
14 years 3 months ago
2011
ACM
Searching is inherently an interactive process usually requiring numerous iterations of querying and assessing in order to find the desired amount of relevant information. Essent...
225
Voted
Book
"The Discrete Fourier Transform (DFT) can be understood as a numerical approximation to the Fourier transform. However, the DFT has its own exact Fourier theory, which is the ...