Sciweavers

5084 search results - page 93 / 1017
» Proving Possibility Properties
Sort
View
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
14 years 11 months ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi
TLCA
2009
Springer
14 years 4 months ago
A Logical Foundation for Environment Classifiers
Taha and Nielsen have developed a multi-stage calculus λα with a sound type system using the notion of environment classifiers. They are special identifiers, with which code fr...
Takeshi Tsukada, Atsushi Igarashi
DS
1992
128views Database» more  DS 1992»
13 years 11 months ago
Achieving Incremental Consistency among Autonomous Replicated Databases
In this paper, we present methods for supporting autonomous updates in replicated databases. Autonomous updates are of particular importance to applications that cannot tolerate t...
Stefano Ceri, Maurice A. W. Houtsma, Arthur M. Kel...
EUROGP
2010
Springer
330views Optimization» more  EUROGP 2010»
14 years 4 months ago
Bandit-Based Genetic Programming
We consider the validation of randomly generated patterns in a Monte-Carlo Tree Search program. Our bandit-based genetic programming (BGP) algorithm, with proved mathematical prope...
Jean-Baptiste Hoock, Olivier Teytaud
MEMOCODE
2003
IEEE
14 years 3 months ago
Methods for exploiting SAT solvers in unbounded model checking
— Modern SAT solvers have proved highly successful in finding counterexamples to temporal properties of systems, using a method known as ”bounded model checking”. It is natu...
Kenneth L. McMillan