2661 search results - page 119 / 533 » Quantum Complexity Classes |
138
click to vote
OTM
2005
Springer
15 years 8 months ago
2005
Springer
There are many problems requiring a semantic account of a database schema. At its best, such an account consists of mapping formulas between the schema and a formal conceptual mode...
121
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
129
click to vote
CORR
2000
Springer
15 years 3 months ago
2000
Springer
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
135
click to vote
SIAMJO
2010
15 years 1 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...
117
click to vote
SSIRI
2010
15 years 1 months ago
2010
—We describe how to use a timeband architecture to model real-time requirements. The architecture separates requirements that use different time units, producing a family of mode...