11160 search results - page 36 / 2232 » Incompleteness in a General Setting |
ARSCOM
2000
13 years 9 months ago
2000
The minimum number of incomplete blocks required to cover, exactly times, all t-element subsets from a set V of cardinality v (v > t) is denoted
ICML
2009
IEEE
14 years 10 months ago
2009
IEEE
We propose a new neural network architecture, called Simple Recurrent Temporal-Difference Networks (SR-TDNs), that learns to predict future observations in partially observable en...
ICDT
2007
ACM
14 years 1 months ago
2007
ACM
Abstract. We review key constraints in the context of XML as introduced by Buneman et al. We show that one of the proposed inference rules is not sound in general, and the axiomati...
ICSE
2003
IEEE-ACM
14 years 10 months ago
2003
IEEE-ACM
Testing of polymorphism in object-oriented software may require coverage of all possible bindings of receiver classes and target methods at call sites. Tools that measure this cove...
CAIP
2003
Springer
14 years 3 months ago
2003
Springer
The problem of independence and completeness of rotation moment invariants is addressed in this paper. General method for constructing invariants of arbitrary orders by means of co...