We propose a modified Balitsky-Fadin-Kuraev-Lipatov equation from the viewpoint of the resummation technique, which contains an intrinsic dependence on momentum transfer Q, and satisfies the unitarity bound. The idea is to relax the strong rapidity ordering and to restrict phase space for real gluon emissions in the evaluation of the BFKL kernel. It is shown that the power-law rise of the gluon...

Symbolic data structures for multi-valued logics are useful in a number of applications, from model-checking to circuit design and switch-level circuit verification. Such data structures are referred to as decision diagrams, and are typically considered effective if they are small, i.e., common co-factors of a function are shared, and canonical, i.e., given a variable ordering, there is a uniqu...

The $5d$-based $\mathrm{Sr}\mathrm{Ir}{\mathrm{O}}_{3}$ represents a prototype example of nonmagnetic correlated metal which mainly originates from combined effect spin-orbit coupling, lattice dimensionality, and crystal structure. Therefore tuning these parameters results in diverse physical properties this material. Here, we study the structural, magnetic, electrical transport behavior epitax...

In this paper, proper optimality concepts in vector optimization with variable ordering structures are introduced for the first time and characterization results via scalarizations are given. New type of scalarizing functionals are presented and their properties are discussed. The scalarization approach suggested in the paper does not require convexity and boundedness conditions.

In this paper we present the use of Constraint Programming for solving balanced academic curriculum problems. We discuss the important role that heuristics play when solving a problem using a constraint-based approach. We also show how constraint solving techniques allow to very efficiently solve combinatorial optimization problems that are too hard for integer programming techniques.

Ordered Binary Decision Diagrams (OBDDs) are the state-of-the-art data structure in CAD for ICs. OBDDs are very sensitive to the chosen variable ordering, i.e. the size may vary from linear to exponential. In this paper we present an Evolutionary Algorithm (EA) that learns good heuristics for OBDD minimization starting from a given set of basic operations. The diierence to other previous approa...

Ordered Binary Decision Diagrams (OBDDs) are the state-of-the-art data structure in CAD for ICs. OBDDs are very sensitive to the chosen variable ordering, i.e. the size may vary from linear to exponential. In this paper we present an Evolutionary Algorithm (EA) that learns good heuristics for OBDD minimization starting from a given set of basic operations. The diierence to other previous approa...

We propose a structure-exploiting heuristic for the justification-based stochastic local search (SLS) method CRSat for Boolean circuit satisfiability. Experimental evaluation shows that the proposed depth-based heuristic significantly improved the performance of CRSat on structural instances arising from industrial applications. A proof of probabilistically approximate completeness (PAC) of CRS...

This paper considers a variety of ways to detect relatively isolated, highly restricted subproblems and then exploit them to guide search for a solution. It introduces a local search method that, prior to search, estimates where such subproblems lie within constraint satisfaction problems. These subproblems are assembled into a secondary structure used with dynamic variable-ordering heuristics ...