406 search results - page 44 / 82 » Pseudorandomness and Combinatorial Constructions |
241
click to vote
CPAIOR
2010
Springer
15 years 4 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
239
click to vote
IPCO
2010
15 years 7 months ago
2010
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other p...
150
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
137
click to vote
MP
1998
15 years 5 months ago
1998
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
158
click to vote
ISW
2009
Springer
16 years 20 days ago
2009
Springer
We present ShMAC (Shallow MAC), a fixed input length message authentication code that performs most of the computation prior to the availability of the message. Specifically, Sh...