325 search results - page 42 / 65 » Proofs of Restricted Shuffles |
SIAMJO
2010
13 years 8 months ago
2010
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We prove that interactive learning based classical realizability (introduced by Aschieri and Berardi for first order arithmetic [1]) is sound with respect to Coquand game...
LPAR
2010
Springer
13 years 7 months ago
2010
Springer
Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. In a recent paper, we have sho...
PPDP
2010
Springer
13 years 7 months ago
2010
Springer
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
—In this contribution we provide a thorough stability analysis of gradient type algorithms with non-symmetric matrix step-sizes. We hereby extend existing analyses for symmetric ...