Sciweavers

8824 search results - page 90 / 1765
» On the Complexity of Real Functions
Sort
View
FSTTCS
2008
Springer
15 years 5 months ago
Analyzing the Implicit Computational Complexity of object-oriented programs
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
Jean-Yves Marion, Romain Péchoux
FBIT
2007
IEEE
15 years 10 months ago
Learning to Drive a Real Car in 20 Minutes
The paper describes our first experiments on Reinforcement Learning to steer a real robot car. The applied method, Neural Fitted Q Iteration (NFQ) is purely data-driven based on ...
Martin Riedmiller, Michael Montemerlo, Hendrik Dah...
CIE
2006
Springer
15 years 7 months ago
Coinductive Proofs for Basic Real Computation
We describe two representations for real numbers, signed digit streams and Cauchy sequences. We give coinductive proofs for the correctness of functions converting between these tw...
Tie Hou
ICRA
2010
IEEE
158views Robotics» more  ICRA 2010»
15 years 2 months ago
Towards optimally efficient field estimation with threshold-based pruning in real robotic sensor networks
Abstract-- The efficiency of distributed sensor networks depends on an optimal trade-off between the usage of resources and data quality. The work in this paper addresses the probl...
Amanda Prorok, Christopher M. Cianci, Alcherio Mar...
FOCS
2010
IEEE
15 years 2 months ago
The Monotone Complexity of k-clique on Random Graphs
It is widely suspected that Erdos-R
Benjamin Rossman