58 search results - page 3 / 12 » Almost Every Domain is Universal |
MLQ
2007
13 years 5 months ago
2007
We define two notions for intuitionistic predicate logic: that of a submodel of a Kripke model, and that of a universal sentence. We then prove a corresponding preservation theor...
FOCS
2008
IEEE
13 years 6 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
BMCBI
2004
13 years 5 months ago
2004
Background: Several in silico methods exist that were developed to predict protein interactions from the copious amount of genomic and proteomic data. One of these methods is Doma...
SIGECOM
2011
ACM
12 years 8 months ago
2011
ACM
In many settings, a group of agents must come to a joint decision on multiple issues. In practice, this is often done by voting on the issues in sequence. In this paper, we model ...
TCS
2011
13 years 13 days ago
2011
The PAC-learning model is distribution-independent in the sense that the learner must reach a learning goal with a limited number of labeled random examples without any prior know...