Sciweavers

496 search results - page 22 / 100
» Machine models and lower bounds for query processing
Sort
View
CEFP
2005
Springer
14 years 1 months ago
Exploiting Purely Functional Programming to Obtain Bounded Resource Behaviour: The Hume Approach
This chapter describes Hume: a functionally-based language for programming with bounded resource usage, including time and space properties. The purpose of the Hume language design...
Kevin Hammond
COLT
1994
Springer
13 years 11 months ago
An Optimal Parallel Algorithm for Learning DFA
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
José L. Balcázar, Josep Díaz,...
COLT
2000
Springer
14 years 1 days ago
Estimation and Approximation Bounds for Gradient-Based Reinforcement Learning
We model reinforcement learning as the problem of learning to control a Partially Observable Markov Decision Process (  ¢¡¤£¦¥§  ), and focus on gradient ascent approache...
Peter L. Bartlett, Jonathan Baxter
BDA
2003
13 years 9 months ago
Memory Requirements for Query Execution in Highly Constrained Devices
Pervasive computing introduces data management requirements that must be tackled in a growingvariety of lightweight computing devices. Personal folders on chip, networks of sensor...
Nicolas Anciaux, Luc Bouganim, Philippe Pucheral
WSC
1998
13 years 9 months ago
Modeling at the Machine-Control Level Using Discrete Event Simulation (DES)
Simulation at the machine-control level plays an important role in designing machine controls and operational specifications. Recently, there has been a considerable amount of wor...
Raid Al-Aomar, Daniel Cook