Sciweavers

4397 search results - page 253 / 880
» Relational Algebra Operations
Sort
View
ENTCS
2007
153views more  ENTCS 2007»
15 years 4 months ago
The Methods of Approximation and Lifting in Real Computation
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
Manuel Lameiras Campagnolo, Kerry Ojakian
PPSN
2000
Springer
15 years 8 months ago
Using Dynastic Exploring Recombination to Promote Diversity in Genetic Search
A family of recombination operators is studied in this work. These operators are based on keeping and using certain information about the past evolution of the algorithm to guide t...
Carlos Cotta, José M. Troya
ER
2004
Springer
93views Database» more  ER 2004»
15 years 9 months ago
Schema Versioning in Data Warehouses
Abstract. As several mature implementations of data warehousing systems are fully operational, a crucial role in preserving their up-to-dateness is played by the ability to manage ...
Matteo Golfarelli, Jens Lechtenbörger, Stefan...
ANTS
2010
Springer
260views Algorithms» more  ANTS 2010»
15 years 8 months ago
On the Complexity of the Montes Ideal Factorization Algorithm
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
David Ford, Olga Veres
IFM
2000
Springer
104views Formal Methods» more  IFM 2000»
15 years 8 months ago
Structuring Real-Time Object-Z Specifications
This paper presents a means of structuring specifications in real-time Object-Z: an integration of Object-Z with the timed refinement calculus. Incremental modification of classes ...
Graeme Smith, Ian J. Hayes