33356 search results - page 6351 / 6672 » Models of Continual Computation |
230
click to vote
VLDB
2001
ACM
15 years 11 months ago
2001
ACM
Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer’s e...
179
click to vote
SIGOPSE
2000
ACM
15 years 11 months ago
2000
ACM
Recently there has been a renewed interest in the application of economic models to the management of computational resources. Most of this interest is focused on pricing models f...
174
click to vote
EUROCOLT
1999
Springer
15 years 11 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
200
click to vote
KDD
1999
ACM
15 years 11 months ago
1999
ACM
Code synthesis is routinely used in industry to generate GUIs, form lling applications, and database support code and is even used with COBOL. In this paper we consider the questi...
200
click to vote
KES
1999
Springer
15 years 11 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...