Order Total (1 Item Items):
Shipping Destination:
Hains Gaetan (14 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (14)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (11)
- As New, Fine or Near Fine (3)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (11)
- Not Print on Demand (9)
Language (2)
Free Shipping
- Free Shipping to U.S.A. (No further results match this refinement)
Seller Location
Seller Rating
-
Softcover. Condition: Très bon. Ancien livre de bibliothèque avec équipements. Edition 2018. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 2018. Ammareal gives back up to 15% of this item's net price to charity organizations.
-
Parallel Algorithms for Free and Associative-Commutative Unification
Language: English
Published by LAP LAMBERT Academic Publishing, 2014
ISBN 10: 3659639923 ISBN 13: 9783659639920
Condition: New.
-
Parallel Algorithms for Free and Associative-Commutative Unification
Language: English
Published by LAP LAMBERT Academic Publishing, 2014
ISBN 10: 3659639923 ISBN 13: 9783659639920
Taschenbuch. Condition: Neu. Parallel Algorithms for Free and Associative-Commutative Unification | Gaetan J. D. R. Hains | Taschenbuch | 128 S. | Englisch | 2014 | LAP LAMBERT Academic Publishing | EAN 9783659639920 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.
-
Arrays, Functional Languages, and Parallel Systems
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 136.78
£ 15 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Condition: New.
-
Condition: New.
-
Gebunden. Condition: New.
-
Arrays, Functional Languages, and Parallel Systems
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 198.99
£ 15 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Condition: As New. Unread book in perfect condition.
-
Parallel Algorithms for Free and Associative-Commutative Unification
Language: English
Published by LAP LAMBERT Academic Publishing Nov 2014, 2014
ISBN 10: 3659639923 ISBN 13: 9783659639920
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This 1990 work is written as a guide to the design of fast algorithms for free term matching, free unification and associative-commutative term matching. The goal of this research was to identify tractable unification problems, to evaluate existing methods for their solution and design new ones where appropriate. The emphasis is on speed, as measured by the worst-case complexity of algorithms. Only methods with direct relevance to practical use were chosen, and are presented in the wider context of unification theory. Few assumptions are made about the environment in which unification is to be used. Terms are represented as graphs, the most common data structure in use now. Results presented here should be useful in the implementation of fast symbolic manipulation systems and their application to scalable intelligent software. 128 pp. Englisch.
-
Parallel Algorithms for Free and Associative-Commutative.
Language: English
Published by LAP LAMBERT Academic Publishing, 2014
ISBN 10: 3659639923 ISBN 13: 9783659639920
Condition: New. Print on Demand.
-
Parallel Algorithms for Free and Associative-Commutative.
Language: English
Published by LAP LAMBERT Academic Publishing, 2014
ISBN 10: 3659639923 ISBN 13: 9783659639920
Condition: New. PRINT ON DEMAND.
-
Parallel Algorithms for Free and Associative-Commutative Unification
Language: English
Published by LAP LAMBERT Academic Publishing Nov 2014, 2014
ISBN 10: 3659639923 ISBN 13: 9783659639920
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This 1990 work is written as a guide to the design of fast algorithms for free term matching, free unification and associative-commutative term matching. The goal of this research was to identify tractable unification problems, to evaluate existing methods for their solution and design new ones where appropriate. The emphasis is on speed, as measured by the worst-case complexity of algorithms. Only methods with direct relevance to practical use were chosen, and are presented in the wider context of unification theory. Few assumptions are made about the environment in which unification is to be used. Terms are represented as graphs, the most common data structure in use now. Results presented here should be useful in the implementation of fast symbolic manipulation systems and their application to scalable intelligent software.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 128 pp. Englisch.
-
Parallel Algorithms for Free and Associative-Commutative Unification
Language: English
Published by LAP LAMBERT Academic Publishing, 2014
ISBN 10: 3659639923 ISBN 13: 9783659639920
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This 1990 work is written as a guide to the design of fast algorithms for free term matching, free unification and associative-commutative term matching. The goal of this research was to identify tractable unification problems, to evaluate existing methods for their solution and design new ones where appropriate. The emphasis is on speed, as measured by the worst-case complexity of algorithms. Only methods with direct relevance to practical use were chosen, and are presented in the wider context of unification theory. Few assumptions are made about the environment in which unification is to be used. Terms are represented as graphs, the most common data structure in use now. Results presented here should be useful in the implementation of fast symbolic manipulation systems and their application to scalable intelligent software.
