3229 search results - page 229 / 646 » The Theory of Timed Automata |
156
Voted
PODS
2004
ACM
16 years 6 months ago
2004
ACM
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
163
click to vote
LICS
2009
IEEE
16 years 1 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...
170
click to vote
IDEAS
2007
IEEE
16 years 28 days ago
2007
IEEE
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
162
click to vote
CAI
2007
Springer
16 years 24 days 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...
153
click to vote
CPAIOR
2007
Springer
16 years 24 days 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...