Sciweavers

2214 search results - page 265 / 443
» Complexity of Reasoning
Sort
View
136
Voted
ICFEM
2009
Springer
15 years 10 months ago
Combining Static Model Checking with Dynamic Enforcement Using the Statecall Policy Language
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which pr...
Anil Madhavapeddy
162
Voted
PODS
1995
ACM
139views Database» more  PODS 1995»
15 years 7 months ago
Normalizing Incomplete Databases
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
Leonid Libkin
129
Voted
NIPS
2007
15 years 5 months ago
Learning and using relational theories
Much of human knowledge is organized into sophisticated systems that are often called intuitive theories. We propose that intuitive theories are mentally represented in a logical ...
Charles Kemp, Noah Goodman, Joshua B. Tenenbaum
127
Voted
BMCBI
2008
87views more  BMCBI 2008»
15 years 3 months ago
Volume-based solvation models out-perform area-based models in combined studies of wild-type and mutated protein-protein interfa
Background: Empirical binding models have previously been investigated for the energetics of protein complexation (G models) and for the influence of mutations on complexation (i....
Salim Bougouffa, Jim Warwicker
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
15 years 3 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan