10 search results - page 2 / 2 » Determinacy in strong cardinal models |
BSL
2011
13 years 1 months ago
2011
show that an abstract analysis of one of these three set theoretic principles can sometimes lead us to results that do not require additional axioms at all but which could have bee...
CP
2004
Springer
13 years 11 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
CPAIOR
2009
Springer
14 years 25 days ago
2009
Springer
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
VLDB
2005
ACM
13 years 11 months ago
2005
ACM
A “plan diagram” is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. In this paper, we present and an...
FOCS
2008
IEEE
14 years 22 days ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...