976 search results - page 17 / 196 » The Complexity of Timetable Construction Problems |
HYBRID
2009
Springer
14 years 1 months ago
2009
Springer
In this paper, we present an automatable decompositional method for the computation of Lyapunov functions for hybrid systems with complex discrete state spaces. We use graph-based ...
CRYPTO
2004
Springer
14 years 4 days ago
2004
Springer
Abstract. In this paper, we study the existence of multicollisions in iterated hash functions. We show that finding multicollisions, i.e. r-tuples of messages that all hash to the...
FLAIRS
2007
13 years 9 months ago
2007
POMDPs are a popular framework for representing decision making problems that contain uncertainty. The high computational complexity of finding exact solutions to POMDPs has spaw...
ICMLA
2008
13 years 8 months ago
2008
In reinforcement learning, it is a common practice to map the state(-action) space to a different one using basis functions. This transformation aims to represent the input data i...
HYBRID
2004
Springer
14 years 3 days 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...