1274 search results - page 152 / 255 » New Proofs for |
102
click to vote
SAT
2009
Springer
15 years 6 months ago
2009
Springer
We introduce Cardinality Networks, a new CNF encoding of cardinality constraints. It improves upon the previously existing encodings such as the sorting networks of [ES06] in that ...
161
Voted
CONSTRAINTS
2011
14 years 6 months ago
2011
We introduce Cardinality Networks, a new CNF encoding of cardinality constraints. It improves upon the previously existing encodings such as the sorting networks of [8] in that it ...
113
click to vote
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
116
click to vote
ENTCS
2006
14 years 12 months ago
2006
In this paper we introduce a new approach to formalizing certain type operations in type theory. Traditionally, many type constructors in type theory are independently axiomatized...
MP
2007
14 years 11 months ago
2007
The question of nonemptiness of the intersection of a nested sequence of closed sets is fundamental in a number of important optimization topics, including the existence of optima...