1246 search results - page 170 / 250 » Recursive Timed Automata |
117
click to vote
LATA
2009
Springer
15 years 9 months ago
2009
Springer
We propose an algorithm that given as input a full word w of length n, and positive integers p and d, outputs (if any exists) a maximal p-periodic partial word contained in w with ...
116
Voted
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
—We associate a statistical vector to a trace and a geometrical embedding to a Markov Decision Process, based on a distance on words, and study basic Membership and Equivalence p...
120
Voted
CAI
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
137
Voted
CEEMAS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We are interested in understanding and simulating how humans elaborate plans in situations where knowledge is incomplete and how they interact to obtain missing informati...
112
click to vote
CPAIOR
2007
Springer
15 years 8 months ago
2007
Springer
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...