Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 178,21
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
EUR 195,42
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: New.
EUR 229,57
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 234,67
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 252,53
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
EUR 244,69
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: New.
Publicado por Springer Berlin Heidelberg, 2012
ISBN 10: 3642260497 ISBN 13: 9783642260490
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 246,09
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, e. g. , the cost involved when executing a transition, the amount of resources or time needed for this,or the probability or reliability of its successful execution. The behavior of weighted finite automata can then be considered as the function (suitably defined) associating with each word the weight of its execution. Clearly, weights can also be added to classical automata with infinite state sets like pushdown automata; this extension constitutes the general concept of weighted automata. To illustrate the diversity of weighted automata, let us consider the following scenarios. Assume that a quantitative system is modeled by a classical automaton in which the transitions carry as weights the amount of resources needed for their execution. Then the amount of resources needed for a path in this weighted automaton is obtained simply as the sum of the weights of its transitions. Given a word, we might be interested in the minimal amount of resources needed for its execution, i. e. , for the successful paths realizing the given word. In this example, we could also replace the 'resources' by 'profit' and then be interested in the maximal profit realized, correspondingly, by a given word.
Publicado por Springer Berlin Heidelberg, 2009
ISBN 10: 3642014917 ISBN 13: 9783642014918
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 246,09
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, e. g. , the cost involved when executing a transition, the amount of resources or time needed for this,or the probability or reliability of its successful execution. The behavior of weighted finite automata can then be considered as the function (suitably defined) associating with each word the weight of its execution. Clearly, weights can also be added to classical automata with infinite state sets like pushdown automata; this extension constitutes the general concept of weighted automata. To illustrate the diversity of weighted automata, let us consider the following scenarios. Assume that a quantitative system is modeled by a classical automaton in which the transitions carry as weights the amount of resources needed for their execution. Then the amount of resources needed for a path in this weighted automaton is obtained simply as the sum of the weights of its transitions. Given a word, we might be interested in the minimal amount of resources needed for its execution, i. e. , for the successful paths realizing the given word. In this example, we could also replace the 'resources' by 'profit' and then be interested in the maximal profit realized, correspondingly, by a given word.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 290,36
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Publicado por Springer Berlin Heidelberg, Springer Berlin Heidelberg Mär 2012, 2012
ISBN 10: 3642260497 ISBN 13: 9783642260490
Idioma: Inglés
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 246,09
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Neuware -The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, e. g. , the cost involved when executing a transition, the amount of resources or time needed for this,or the probability or reliability of its successful execution. The behavior of weighted finite automata can then be considered as the function (suitably defined) associating with each word the weight of its execution. Clearly, weights can also be added to classical automata with infinite state sets like pushdown automata; this extension constitutes the general concept of weighted automata. To illustrate the diversity of weighted automata, let us consider the following scenarios. Assume that a quantitative system is modeled by a classical automaton in which the transitions carry as weights the amount of resources needed for their execution. Then the amount of resources needed for a path in this weighted automaton is obtained simply as the sum of the weights of its transitions. Given a word, we might be interested in the minimal amount of resources needed for its execution, i. e. , for the successful paths realizing the given word. In this example, we could also replace the ¿resources¿ by ¿profit¿ and then be interested in the maximal profit realized, correspondingly, by a given word.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 628 pp. Englisch.
Publicado por Springer Berlin Heidelberg, Springer Berlin Heidelberg Sep 2009, 2009
ISBN 10: 3642014917 ISBN 13: 9783642014918
Idioma: Inglés
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 246,09
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. Neuware -The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, e. g. , the cost involved when executing a transition, the amount of resources or time needed for this,or the probability or reliability of its successful execution. The behavior of weighted finite automata can then be considered as the function (suitably defined) associating with each word the weight of its execution. Clearly, weights can also be added to classical automata with infinite state sets like pushdown automata; this extension constitutes the general concept of weighted automata. To illustrate the diversity of weighted automata, let us consider the following scenarios. Assume that a quantitative system is modeled by a classical automaton in which the transitions carry as weights the amount of resources needed for their execution. Then the amount of resources needed for a path in this weighted automaton is obtained simply as the sum of the weights of its transitions. Given a word, we might be interested in the minimal amount of resources needed for its execution, i. e. , for the successful paths realizing the given word. In this example, we could also replace the ¿resources¿ by ¿profit¿ and then be interested in the maximal profit realized, correspondingly, by a given word.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 628 pp. Englisch.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 236,27
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 236,48
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 339,41
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 628.
EUR 350,49
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 2009 edition. 625 pages. 9.25x6.10x1.27 inches. In Stock.
Publicado por Springer-Verlag New York Inc, 2009
ISBN 10: 3642014917 ISBN 13: 9783642014918
Idioma: Inglés
Librería: Revaluation Books, Exeter, Reino Unido
EUR 354,41
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 1st edition. 608 pages. 9.53x6.38x1.73 inches. In Stock.
Publicado por Springer Berlin Heidelberg, 2012
ISBN 10: 3642260497 ISBN 13: 9783642260490
Idioma: Inglés
Librería: moluna, Greven, Alemania
EUR 206,40
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Includes supplementary material: sn.pub/extrasThe purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted ?nite automata are classical nondeterministic ?nite automata in which the transitions carry wei.
Publicado por Springer Berlin Heidelberg, 2009
ISBN 10: 3642014917 ISBN 13: 9783642014918
Idioma: Inglés
Librería: moluna, Greven, Alemania
EUR 206,40
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Includes supplementary material: sn.pub/extrasThe purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted ?nite automata are classical nondeterministic ?nite automata in which the transitions carry wei.
Publicado por Springer Berlin Heidelberg Mrz 2012, 2012
ISBN 10: 3642260497 ISBN 13: 9783642260490
Idioma: Inglés
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 246,09
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, e. g. , the cost involved when executing a transition, the amount of resources or time needed for this,or the probability or reliability of its successful execution. The behavior of weighted finite automata can then be considered as the function (suitably defined) associating with each word the weight of its execution. Clearly, weights can also be added to classical automata with infinite state sets like pushdown automata; this extension constitutes the general concept of weighted automata. To illustrate the diversity of weighted automata, let us consider the following scenarios. Assume that a quantitative system is modeled by a classical automaton in which the transitions carry as weights the amount of resources needed for their execution. Then the amount of resources needed for a path in this weighted automaton is obtained simply as the sum of the weights of its transitions. Given a word, we might be interested in the minimal amount of resources needed for its execution, i. e. , for the successful paths realizing the given word. In this example, we could also replace the 'resources' by 'profit' and then be interested in the maximal profit realized, correspondingly, by a given word. 628 pp. Englisch.
Publicado por Springer Berlin Heidelberg Sep 2009, 2009
ISBN 10: 3642014917 ISBN 13: 9783642014918
Idioma: Inglés
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 246,09
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, e. g. , the cost involved when executing a transition, the amount of resources or time needed for this,or the probability or reliability of its successful execution. The behavior of weighted finite automata can then be considered as the function (suitably defined) associating with each word the weight of its execution. Clearly, weights can also be added to classical automata with infinite state sets like pushdown automata; this extension constitutes the general concept of weighted automata. To illustrate the diversity of weighted automata, let us consider the following scenarios. Assume that a quantitative system is modeled by a classical automaton in which the transitions carry as weights the amount of resources needed for their execution. Then the amount of resources needed for a path in this weighted automaton is obtained simply as the sum of the weights of its transitions. Given a word, we might be interested in the minimal amount of resources needed for its execution, i. e. , for the successful paths realizing the given word. In this example, we could also replace the 'resources' by 'profit' and then be interested in the maximal profit realized, correspondingly, by a given word. 628 pp. Englisch.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 360,18
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 628.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 359,01
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 628.