Sciweavers

940 search results - page 122 / 188
» New Cryptanalytic Results on IDEA
Sort
View
VLDB
1994
ACM
129views Database» more  VLDB 1994»
15 years 4 months ago
Hilbert R-tree: An Improved R-tree using Fractals
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
Ibrahim Kamel, Christos Faloutsos
ATAL
2006
Springer
15 years 3 months ago
A hierarchical approach to efficient reinforcement learning in deterministic domains
Factored representations, model-based learning, and hierarchies are well-studied techniques for improving the learning efficiency of reinforcement-learning algorithms in large-sca...
Carlos Diuk, Alexander L. Strehl, Michael L. Littm...
ATAL
2006
Springer
15 years 3 months ago
False-name-proof combinatorial auction protocol: Groves Mechanism with SubModular Approximation
This paper develops a new combinatorial auction protocol called the Groves Mechanism with SubModular Approximation (GM-SMA). This protocol satisfies the following characteristics:...
Makoto Yokoo, Toshihiro Matsutani, Atsushi Iwasaki
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
15 years 3 months ago
Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
Iason Hatzakis, David Wallace
ADBIS
2000
Springer
117views Database» more  ADBIS 2000»
15 years 3 months ago
Multiversion Linear Quadtree for Spatio-Temporal Data
Research in spatio-temporal databases has largely focused on extensions of access methods for the proper handling of time changing spatial information. In this paper, we present th...
Theodoros Tzouramanis, Michael Vassilakopoulos, Ya...