1705 search results - page 109 / 341 » Representing Constraints with Automata |
121
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
139
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
119
click to vote
FGCS
2006
15 years 4 months ago
2006
We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as network...
111
click to vote
TODAES
2008
15 years 3 months ago
2008
Abstract-- Automata-based methods for generating PSL hardware assertion checkers were primarily considered for use with temporal sequences, as opposed to full-scale properties. We ...
107
click to vote
ACL
2010
15 years 2 months ago
2010
A central problem in historical linguistics is the identification of historically related cognate words. We present a generative phylogenetic model for automatically inducing cogn...