Sciweavers

110 search results - page 16 / 22
» Performance analysis by topology indexed lookup tables
Sort
View
ICML
1995
IEEE
15 years 10 months ago
Residual Algorithms: Reinforcement Learning with Function Approximation
A number of reinforcement learning algorithms have been developed that are guaranteed to converge to the optimal solution when used with lookup tables. It is shown, however, that ...
Leemon C. Baird III
WWW
2006
ACM
15 years 10 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
MONET
2010
125views more  MONET 2010»
14 years 8 months ago
GTPP: General Truncated Pyramid Peer-to-Peer Architecture over Structured DHT Networks
— Hierarchical Distributed Hash Table (DHT) architectures have been among the most interesting research topics since the birth of flat DHT architecture. However, most of the prev...
Zhonghong Ou, Erkki Harjula, Timo Koskela, Mika Yl...
VLDB
2004
ACM
93views Database» more  VLDB 2004»
15 years 3 months ago
Symmetric Relations and Cardinality-Bounded Multisets in Database Systems
In a binary symmetric relationship, A is related to B if and only if B is related to A. Symmetric relationships between k participating entities can be represented as multisets of...
Kenneth A. Ross, Julia Stoyanovich
VLDB
2000
ACM
248views Database» more  VLDB 2000»
15 years 1 months ago
Multi-Dimensional Database Allocation for Parallel Data Warehouses
Data allocation is a key performance factor for parallel database systems (PDBS). This holds especially for data warehousing environments where huge amounts of data and complex an...
Thomas Stöhr, Holger Märtens, Erhard Rah...