We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
Abstract. The objective function of the genome rearrangement problems allows the integration of other genome-level problems so that they may be solved simultaneously. Three example...
— We consider the control of impulsive systems with jumps triggered by a renewal process, that is, the intervals between jumps are independent and identically distributed. The co...
We present an approach to the analysis and optimization of heterogeneous distributed embedded systems for hard real-time applications. The systems are heterogeneous not only in te...
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...