47 search results - page 6 / 10 » Enhancing set constraint solvers with lexicographic bounds |
TACAS
2010
Springer
14 years 18 days ago
2010
Springer
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
CASES
2009
ACM
14 years 2 months ago
2009
ACM
Embedded processors have become increasingly complex, resulting in variable execution behavior and reduced timing predictability. On such processors, safe timing specifications e...
JSA
2000
13 years 7 months ago
2000
In this paper, we address the problem of scheduling hybrid task sets consisting of hard periodic and soft aperiodic tasks that may share resources in exclusive mode in a dynamic e...
RTSS
1997
IEEE
13 years 11 months ago
1997
IEEE
In certain real-time applications, ranging from multimedia to telecommunication systems, timing constraints can be more flexible than scheduling theory usually permits. For exampl...
MP
2008
13 years 7 months ago
2008
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...