Sciweavers

280 search results - page 9 / 56
» Storage Alternatives for Large Structured State Spaces
Sort
View
IOPADS
1996
87views more  IOPADS 1996»
13 years 10 months ago
Structured Permuting in Place on Parallel Disk Systems
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
Leonard F. Wisniewski
ADBIS
2003
Springer
114views Database» more  ADBIS 2003»
14 years 1 months ago
Compressing Large Signature Trees
In this paper we present a new compression scheme for signature tree structures. Beyond the reduction of storage space, compression attains significant savings in terms of query pr...
Maria Kontaki, Yannis Manolopoulos, Alexandros Nan...
FGCS
2006
83views more  FGCS 2006»
13 years 8 months ago
Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems
We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as network...
Anne Benoit, Brigitte Plateau, William J. Stewart
ECAL
2001
Springer
14 years 1 months ago
The Use of Latent Semantic Indexing to Identify Evolutionary Trajectories in Behaviour Space
This paper describes the simulation of a foraging agent in an environment with a simple ecological structure, alternatively using one of three different control systems with varyi...
Ian R. Edmonds
SAS
2010
Springer
121views Formal Methods» more  SAS 2010»
13 years 7 months ago
Alternation for Termination
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
William R. Harris, Akash Lal, Aditya V. Nori, Srir...