Sciweavers

113 search results - page 14 / 23
» On solving a hard quadratic 3-dimensional assignment problem
Sort
View
SAT
2005
Springer
104views Hardware» more  SAT 2005»
15 years 4 months ago
Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming
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...
Marijn Heule, Hans van Maaren
RECOMB
2005
Springer
15 years 11 months ago
Reversals of Fortune
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...
David Sankoff, Chunfang Zheng, Aleksander Lenert
CDC
2009
IEEE
160views Control Systems» more  CDC 2009»
15 years 3 months ago
Control of impulsive renewal systems: Application to direct design in networked control
— 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...
Duarte Antunes, João Pedro Hespanha, Carlos...
RTCSA
2005
IEEE
15 years 4 months ago
Optimization of Hierarchically Scheduled Heterogeneous Embedded Systems
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...
Traian Pop, Paul Pop, Petru Eles, Zebo Peng
CP
2005
Springer
15 years 4 months ago
Planning and Scheduling to Minimize Tardiness
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...
John N. Hooker