898 search results - page 93 / 180 » Transitions of the Pre-Symmetry Set |
156
click to vote
EVOW
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...
197
click to vote
FORMATS
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
161
click to vote
IJCAI
2007
15 years 7 months ago
2007
In recent years, there has been a growing interest in using rich representations such as relational languages for reinforcement learning. However, while expressive languages have ...
195
click to vote
CADE
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
182
click to vote
CONCUR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...