Sciweavers

3353 search results - page 376 / 671
» Laver and set theory
Sort
View
VLDB
1989
ACM
150views Database» more  VLDB 1989»
15 years 10 months ago
Aggregates in Possibilistic Databases
Fuzzy set theory represents a uniform framework for extending the relational database model to han-, dle imprecision of information found in the real world. None of the existing p...
Elke A. Rundensteiner, Lubomir Bic
CDC
2009
IEEE
15 years 10 months ago
On the queue-overflow probabilities of distributed scheduling algorithms
Abstract-- In this paper, we are interested in using largedeviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless sch...
Can Zhao, Xiaojun Lin
CSL
2007
Springer
15 years 10 months ago
MSO on the Infinite Binary Tree: Choice and Order
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
Arnaud Carayol, Christof Löding
CIE
2009
Springer
15 years 10 months ago
Spectra of Algebraic Fields and Subfields
An algebraic field extension of Q or Z/(p) may be regarded either as a structure in its own right, or as a subfield of its algebraic closure F (either Q or Z/(p)). We consider the ...
Andrey Frolov, Iskander Sh. Kalimullin, Russell Mi...
ICFEM
2007
Springer
15 years 10 months ago
Testing for Refinement in CSP
Abstract. CSP is a well-established formalism for modelling and verification of concurrent reactive systems based on refinement. Consolidated denotational models and an effective t...
Ana Cavalcanti, Marie-Claude Gaudel