Sciweavers

258 search results - page 52 / 52
» Some Notes on Fine Computability
Sort
View
COMGEO
2011
ACM
13 years 2 months ago
Improved bounds for cops-and-robber pursuit
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...
Laurent Alonso, Edward M. Reingold
ICML
1996
IEEE
14 years 8 months ago
Learning Evaluation Functions for Large Acyclic Domains
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
Justin A. Boyan, Andrew W. Moore

Lecture Notes
4961views
15 years 5 months ago
The Relational Data Model, Normalisation and effective Database Design
I have been designing and building applications, including the databases used by those applications, for several decades now. I have seen similar problems approached by different d...
Tony Marston