Sciweavers

2032 search results - page 43 / 407
» Encodings of the Sequence Constraint
Sort
View
DM
1998
60views more  DM 1998»
14 years 11 months ago
On numbers of Davenport-Schinzel sequences
One class of Davenport-Schinzel sequences consists of finite sequences over n symbols without immediate repetitions and without any subsequence of the type abab. We present a bij...
Martin Klazar
AIMSA
2008
Springer
15 years 1 months ago
Interleaved Alldifferent Constraints: CSP vs. SAT Approaches
In this paper, we want to handle multiple interleaved Alldiff constraints from two points of view: a uniform propagation framework with some CSP reduction rules and a SAT encoding ...
Frédéric Lardeux, Eric Monfroy, Fr&e...
AI
2008
Springer
14 years 12 months ago
Solving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
CORR
2008
Springer
107views Education» more  CORR 2008»
14 years 12 months ago
Maximum Entropy Rate of Markov Sources for Systems With Non-regular Constraints
Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained sy...
Georg Böcherer, Valdemar Cardoso da Rocha Jr....
CPM
2007
Springer
99views Combinatorics» more  CPM 2007»
15 years 6 months ago
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for discrete time-independent HMMs. We discuss the applicatio...
Shay Mozes, Oren Weimann, Michal Ziv-Ukelson