2029 search results - page 345 / 406 » informs 2002 |
SAC
2002
ACM
13 years 8 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
SAC
2002
ACM
13 years 8 months ago
2002
ACM
We investigate the universal characteristics of the simulated time horizon of the basic conservative parallel algorithm when implemented on regular lattices. This technique [1, 2]...
SAC
2002
ACM
13 years 8 months ago
2002
ACM
1 Data distribution and replication in distributed systems require special purpose middleware tools for accessing replicated data. Data Grids, special forms of a systems distribute...
SIAMCO
2002
13 years 8 months ago
2002
In this paper we give sufficient conditions for a bang-bang regular extremal to be a strong local optimum for a control problem in the Mayer form; strong means that we consider the...
SIGKDD
2002
13 years 8 months ago
2002
The primary aim of most data mining algorithms is to facilitate the discovery of concise and interpretable information from large amounts of data. However, many of the current for...