Sciweavers

16430 search results - page 126 / 3286
» On Computable Tree Functions
Sort
View
84
Voted
IPPS
2003
IEEE
15 years 8 months ago
The Reconstruction of a Mobile Agent Computation and Its Validation
We propose a new representation to describe mobile agents computations, where the underlying control structures are diffusing computations. Usually, distributed coms are abstracte...
Mamoun Filali, Philippe Mauran, Gérard Padi...
JSCIC
2008
59views more  JSCIC 2008»
15 years 3 months ago
Computing Derivatives of Noisy Signals Using Orthogonal Functions Expansions
In many applications noisy signals are measured. These signals has to be filtered and, sometimes, their derivative have to be computed. In this paper a method for filtering the si...
Adi Ditkowski, Abhinav Bhandari, Brian W. Sheldon
CADE
2008
Springer
16 years 3 months ago
Proving Bounds on Real-Valued Functions with Computations
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
Guillaume Melquiond
PDP
2007
IEEE
15 years 9 months ago
Parallel-External Computation of the Cycle Structure of Invertible Cryptographic Functions
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
Andreas Beckmann, Jorg Keller
111
Voted
WSC
2004
15 years 4 months ago
Poly-Functional Intelligent Agents for Computer Generated Forces
The authors present the requirement definition and methodological approach for developing a new generation of Computer Generated Forces (CGF) based on Intelligent Agents. The anal...
Matteo Brandolini, Attilio Rocca, Agostino G. Bruz...