Sciweavers

5595 search results - page 264 / 1119
» Comparing Subsumption Optimizations
Sort
View
ADBIS
1994
Springer
87views Database» more  ADBIS 1994»
15 years 10 months ago
Variations of R-Tree Structure for Indexing of Spatial Objects
The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial ob...
M. G. Martynov
EUROGP
2006
Springer
135views Optimization» more  EUROGP 2006»
15 years 10 months ago
Dynamic Scheduling with Genetic Programming
This paper investigates the use of genetic programming in automatized synthesis of scheduling heuristics. The applied scheduling technique is priority scheduling, where the next st...
Domagoj Jakobovic, Leo Budin
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 6 months ago
Quantization of Discrete Probability Distributions
We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this probl...
Yuriy A. Reznik
DC
2006
15 years 6 months ago
Fast Paxos
Abstract. Paxos and Fast Paxos are optimal consensus algorithms that are simple and elegant, while suitable for efficient implementation. In this paper, we compare the performance ...
Leslie Lamport
PRL
2006
191views more  PRL 2006»
15 years 6 months ago
Applications of hidden Markov models in bar code decoding
We present a novel approach to edge detection in bar code signals using a hidden Markov model (HMM). We also present an algorithm for selection of an optimal filter scale used in ...
S. Kresic-Juric, D. Madej, Fadil Santosa