2354 search results - page 443 / 471 » A Common-Sense Theory of Time |
CIE
2010
Springer
15 years 5 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
119
click to vote
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
125
Voted
EMSOFT
2009
Springer
15 years 5 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
142
Voted
ACMSE
2006
ACM
15 years 5 months ago
2006
ACM
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
126
click to vote
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
There are many methodological approaches for Agent-Oriented Software Engineering, each one focusing on some features of multi-agent systems, but leaving others underdefined. For t...