216 search results - page 14 / 44 » From Constraints to Finite Automata to Filtering Algorithms |
MST
2008
13 years 8 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
The iterated prisoner’s dilemma is a widely used computational model of cooperation and conflict. Many studies report emergent cooperation in populations of agents trained to p...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
CP
2006
Springer
14 years 4 days ago
2006
Springer
Many combinatorial problems, such as car sequencing and rostering, feature sequence constraints, restricting the number of occurrences of certain values in every subsequence of a g...
ICPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Particle filtering is an approach to Bayesian estimation of intractable posterior distributions from time series signals distributed by non-Gaussian noise. A couple of variant par...