Hybrid methods that combine constraintprogramming with mathematical programming make essential use of continuous relaxations for global constraints. We state a relaxation for the cumulative constraint. In particular ...
详细信息
Capturing constraint structure is critical in constraintprogramming to support the configuration and adaptation of domain filtering algorithms. To this end, we propose a software model couplinga relational constraint...
详细信息
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. this paper strengthens this link. We study t...
详细信息
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. this paper strengthens this link. We study the problem of maximizing a supermodular function which is defined on a product of n copies of a fixed finite lattice and given by an oracle. We exhibit a large class of finite lattices for which this problem can be solved in oracle-polynomial time in n. We also obtain new large classes of tractable maximum constraint satisfaction problems.
the aim of this paper is to demonstrate that cp could be abetter candidate than MIP for solving the master problem within a Benders decomposition approach. Our demonstration is based on a case study of a workforce sch...
详细信息
Historically, discrete minimization problems in constrained logical programming were modeled withthe help of an isolated bounding constraint on the objective that is to be decreased. To overcome this frequently ineff...
详细信息
AES is a mainstream block cipher used in many protocols and whose resilience against attack is essential for cybersecurity. In [14], Oren and Wool discuss a Tolerant Algebraic Side-Channel Analysis (TASCA) and show ho...
详细信息
ISBN:
(纸本)9783319661582;9783319661575
AES is a mainstream block cipher used in many protocols and whose resilience against attack is essential for cybersecurity. In [14], Oren and Wool discuss a Tolerant Algebraic Side-Channel Analysis (TASCA) and show how to use optimization technology to exploit side-channel information and mount a computational attack against AES. this paper revisits the results and posits that constraintprogramming is a strong contender and a potent optimization solution. It extends bit-vector solving as introduced in [8], develops a cp and an IP model and compares them withthe original Pseudo-Boolean formulation. the empirical results establish that cp can deliver solutions with orders of magnitude improvement in both run time and memory usage, traits that are essential to potential adoption by cryptographers.
We present a hybrid heuristic search algorithm for constraint satisfaction problems, which was proposed as a mixture of two basic approaches: local search and backtrack based search. One of its major advantages is int...
详细信息
How do we do research?We start with a question. then we read books, journal and conference papers, maybe even speak to people. then we do our own work, make our own contribution, maybe coming up with an improved techn...
详细信息
ISBN:
(纸本)9783319104287;9783319104270
How do we do research?We start with a question. then we read books, journal and conference papers, maybe even speak to people. then we do our own work, make our own contribution, maybe coming up with an improved technique or a greater *** then write up our findings, maybe submit this to a conference, present our work and get feedback, and this results in further research. this is a feedback loop, open to scrutiny by our peers.
In an earlier paper we have shown, how one can successfully use constraint satisfaction techniques for proving and solving formulae in the first-order predicate language over the real numbers (i.e., real first order c...
详细信息
暂无评论