1705 search results - page 30 / 341 » Representing Constraints with Automata |
CP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. This article deals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose size is bounded by a polynomial in n, w...
SP
2008
IEEE
14 years 2 months ago
2008
IEEE
Automata-based representations and related algorithms have been applied to address several problems in information security, and often the automata had to be augmented with additi...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the cont...
HEURISTICS
2006
13 years 7 months ago
2006
In case a CSP is over-constrained, it is natural to allow some constraints, called soft constraints, to be violated. We propose a generic method to soften global constraints that c...
COLT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Probabilistic finite automata (PFA) model stochastic languages, i.e. probability distributions over strings. Inferring PFA from stochastic data is an open field of rese...