On the enumeration of noncrossing partitions with fixed points.
Aristidis SapounakisPanagiotis TsikourasPublished in: Ars Comb. (2004)
Keyphrases
- fixed point
- queueing systems
- transition probabilities
- belief propagation
- approximate value iteration
- markov chain
- clustering algorithm
- sufficient conditions
- markov models
- control problems
- arrival rate
- random walk
- markov processes
- dynamical systems
- free energy
- temporal difference learning
- linear logic
- asymptotic properties
- dynamic programming
- probabilistic model
- markov random field
- single server
- image segmentation
- machine learning