Client interactions with modern web-accessible network services are typically organized into sessions involving multiple requests that read and write shared application data. Ther...
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...
Abstract. This paper proposes the fitness control procedure for the application of genetic algorithms (GA) in pattern recognition. Instead of using GA to solve a concomitant optim...
: In order to meet their temporal constraints, current applications such as Web-based services and electronic commerce use the technique of data replication. To take the replicatio...
The -calculus o ers an attractive basis for concurrent programming. It is small, elegant, and well studied, and supports via simple encodings a wide range of high-level constru...