Sciweavers

1719 search results - page 287 / 344
» Scheduling with soft constraints
Sort
View
CAV
2007
Springer
212views Hardware» more  CAV 2007»
14 years 24 days ago
A Tutorial on Satisfiability Modulo Theories
Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
Leonardo Mendonça de Moura, Bruno Dutertre,...
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
14 years 14 days ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
Christoph Dürr, Mathilde Hurand
HYBRID
1995
Springer
14 years 11 days ago
Compositional and Uniform Modelling of Hybrid Systems
This paper discusses fundamentals of hybrid system modelling. Emphazis is put on compositionality and the use of multiform time. Compositionality refers to the ability of freely co...
Albert Benveniste
RTAS
1995
IEEE
14 years 10 days ago
Design and evaluation of a window-consistent replication service
—Real-time applications typically operate under strict timing and dependability constraints. Although traditional data replication protocols provide fault tolerance, real-time gu...
Ashish Mehra, Jennifer Rexford, Hock-Siong Ang, Fa...
AAAI
2008
13 years 11 months ago
Planning with Problems Requiring Temporal Coordination
We present the first planner capable of reasoning with both the full semantics of PDDL2.1 (level 3) temporal planning and with numeric resources. Our planner, CRIKEY3, employs heu...
Andrew Coles, Maria Fox, Derek Long, Amanda Smith