Sciweavers

1941 search results - page 196 / 389
» On the Hardness of Approximate Reasoning
Sort
View
ILP
2003
Springer
15 years 11 months ago
Graph Kernels and Gaussian Processes for Relational Reinforcement Learning
RRL is a relational reinforcement learning system based on Q-learning in relational state-action spaces. It aims to enable agents to learn how to act in an environment that has no ...
Thomas Gärtner, Kurt Driessens, Jan Ramon
ECCV
2010
Springer
15 years 11 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
VLDB
2001
ACM
115views Database» more  VLDB 2001»
15 years 11 months ago
Dynamic Update Cube for Range-sum Queries
A range-sum query is very popular and becomes important in finding trends and in discovering relationships between attributes in diverse database applications. It sums over the se...
Seok-Ju Chun, Chin-Wan Chung, Ju-Hong Lee, Seok-Ly...
SIGMETRICS
1992
ACM
145views Hardware» more  SIGMETRICS 1992»
15 years 10 months ago
Analysis of the Generalized Clock Buffer Replacement Scheme for Database Transaction Processing
The CLOCK algorithm is a popular buffer replacement algorithm becauseof its simplicity and its ability to approximate the performance of the Least Recently Used (LRU) replacement ...
Victor F. Nicola, Asit Dan, Daniel M. Dias
GLOBECOM
2009
IEEE
15 years 10 months ago
Optimization of Energy Efficient Transmission in Underwater Sensor Networks
Underwater communication is a challenging topic due to its singular channel characteristics. Most protocols used in terrestrial wireless communication can not be directly applied i...
Hongkun Yang, Bin Liu, Fengyuan Ren, Hao Wen, Chua...