EUR 58,62
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: California Books, Miami, FL, U.S.A.
EUR 63,10
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 60,73
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: VDM Verlag Dr. M�ller 2008-04-08, 2008
ISBN 10: 3836491508 ISBN 13: 9783836491501
Da: Chiron Media, Wallingford, Regno Unito
EUR 54,02
Quantità: 10 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 58,05
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
EUR 56,98
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 63,98
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: VDM Verlag Dr. Müller|VDM Verlag Dr. Müller e.K., 2013
ISBN 10: 3836491508 ISBN 13: 9783836491501
Da: moluna, Greven, Germania
EUR 61,42
Quantità: Più di 20 disponibili
Aggiungi al carrelloKartoniert / Broschiert. Condizione: New. Many languages and data structures are of a recursive nature, repeating structures as sub-structures. Arithmetic expressions, virtually all programming languages, and various XML schema definitions are well-known examples. There are several difficulties in .
Da: preigu, Osnabrück, Germania
EUR 57,95
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Processing Recursively Structured Data | A Generic Approach to Parsing and Transforming Data with a Recursive Structure, Illustrated by a Practical Implementation | Norbert Pfaffinger | Taschenbuch | Kartoniert / Broschiert | Englisch | 2013 | VDM Verlag Dr. Müller | EAN 9783836491501 | Verantwortliche Person für die EU: OmniScriptum GmbH & Co. KG, Bahnhofstr. 28, 66111 Saarbrücken, info[at]akademikerverlag[dot]de | Anbieter: preigu.
Da: PBShop.store US, Wood Dale, IL, U.S.A.
EUR 61,01
Quantità: Più di 20 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
EUR 58,68
Quantità: Più di 20 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Lingua: Inglese
Editore: VDM Verlag Dr. Müller, VDM Verlag Dr. Müller E.K., 2008
ISBN 10: 3836491508 ISBN 13: 9783836491501
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 68,82
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Many languages and data structures are of a recursive nature, repeating structures as sub-structures. Arithmetic expressions, virtually all programming languages, and various XML schema definitions are well-known examples. There are several difficulties in writing software operating on such data: For instance, due to stack usage issues it may not be appropriate to use recursive function calls. Furthermore, elaborate solutions are required for efficient memory representations and parsing.This book introduces a generic approach applicable to the processing of any kind of data with a recursive structure. The approach allows for a straight-forward implementation of manipulations of such data, including the use of recursive function expressions. At the same time both memory and runtime efficiency are guaranteed, thus supporting the processing of extremely large data instances. The technique relieves programmers from having to care about implementation details such as memory handling.The approach is illustrated by a practical implementation and its application in mathematical logic, namely for transformations of various well-known knowledge representation and reasoning tasks.; Many languages and data structures are of a recursive nature, repeating structures as sub-structures. Arithmetic expressions, virtually all programming languages, and various XML schema definitions are well-known examples. There are several difficulties in writing software operating on such data: For instance, due to stack usage issues it may not be appropriate to use recursive function calls. Furthermore, elaborate solutions are required for efficient memory representations and parsing.This book introduces a generic approach applicable to the processing of any kind of data with a recursive structure. The approach allows for a straight-forward implementation of manipulations of such data, including the use of recursive function expressions. At the same time both memory and runtime efficiency are guaranteed, thus supporting the processing of extremely large data instances. The technique relieves programmers from having to care about implementation details such as memory handling.The approach is illustrated by a practical implementation and its application in mathematical logic, namely for transformations of various well-known knowledge representation and reasoning tasks.