This book deals with the problem of generating sequences in the style of a given corpus, in text or music. In particular, the authors study Markov models, which have long been used for capturing basic statistical information about how elements of a given alphabet are put together in representative sequences, formulating them as constraint satisfaction problems (CSPs), a formulation which opens the door to many extensions of basic Markov models through the modularity of constraint satisfaction.The book will be valuable to practitioners, researchers, and graduate students engaged with algorithmic composition and constraint satisfaction.
Lieferbar
ISBN | 9783319434964 |
---|---|
Sprache | eng |
Cover | B, Artificial Intelligence, Mathematics in Music, Mathematics of Computing, Computer Appl. in Arts and Humanities, Probability Theory and Stochastic Processes, Music, Computer and Information Systems Applications, Probability Theory, computer science, Mathematics, Computer science—Mathematics, Application software, Probabilities, Applied mathematics, Mathematical theory of computation, Maths for computer scientists, Computer applications in the arts & humanities, Probability & statistics, Stochastics, Fester Einband |
Verlag | Springer Nature EN |
Jahr | 2099 |
Dieser Artikel hat noch keine Bewertungen.