The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
Abstract. This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start...
Patricia Bouyer, Ed Brinksma, Kim Guldstrand Larse...
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
We introduce STORMED hybrid games (SHG), a generalization of STORMED Hybrid Systems [21], which have natural specifications, allow rich continuous dynamics and admit various proper...
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...