1998 search results - page 244 / 400 » Complexity of the Cover Polynomial |
CONCUR
2004
Springer
15 years 6 months ago
2004
Springer
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
87
Voted
CPAIOR
2004
Springer
15 years 6 months ago
2004
Springer
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...
FSTTCS
2004
Springer
15 years 6 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
79
Voted
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
It has been shown empirically that the XCS classifier system solves typical classification problems in a machine learning competitive way. However, until now, no learning time es...
105
Voted
HYBRID
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. An invariant of a system is a predicate that holds for every reachable state. In this paper, we present techniques to generate invariants for hybrid systems. This is achi...