344 search results - page 34 / 69 » The Santa Claus problem |
ML
2000
ACM
13 years 9 months ago
2000
ACM
One of the major limitations of relational learning is due to the complexity of verifying hypotheses on examples. In this paper we investigate this task in light of recent publishe...
CIE
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
LPAR
2012
Springer
12 years 5 months ago
2012
Springer
Abstract. The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has be...
TACAS
2012
Springer
12 years 5 months ago
2012
Springer
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
AGTIVE
2003
Springer
14 years 3 months ago
2003
Springer
Discontinuous constituent are a frequent problem in natural language analyses. A constituent is called discontinuous if it is interrupted by other constituents. In German they can ...