Complexity analysis of a matchmaker based on hidden Markov model for decentralised grid scheduling.
Holman Bolívar BarónMario Martínez RojasRubén González CrespoOscar Sanjuán MartínezPublished in: Int. J. Grid Util. Comput. (2014)
Keyphrases
- hidden markov models
- complexity analysis
- theoretical analysis
- lower bound
- speech recognition
- scheduling problem
- conditional random fields
- gesture recognition
- viterbi algorithm
- computational complexity
- markov models
- sequential data
- first order logic
- hidden states
- markov model
- hierarchical hidden markov model
- handwriting recognition
- hidden state
- artificial intelligence
- forward backward
- phoneme recognition
- knowledge base