4372 search results - page 237 / 875 » Algorithmic Theories of Everything |
143
click to vote
TPHOL
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
167
click to vote
SIGECOM
2010
ACM
15 years 10 months ago
2010
ACM
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
151
click to vote
SOFSEM
2009
Springer
15 years 10 months ago
2009
Springer
In this text we will discuss different forms of randomness in Natural Sciences and present some recent results relating them. In finite processes, randomness differs in various ...
149
click to vote
NLPRS
2001
Springer
15 years 10 months ago
2001
Springer
This paper proposes a new prosodic phrasing model for Chinese text-tospeech systems. First, in contrast to the commonly used CART techniques, we propose a new inductive learning a...
139
click to vote
ANTS
2000
Springer
15 years 10 months ago
2000
Springer
We shall discuss the idea of finding all rational points on a curve C by first finding an associated collection of curves whose rational points cover those of C. This classical ...