Function Programming Algorithm (10 results)
- More images
Function programming algorithm(Chinese Edition)
YUE HAN DA WEI SI TONG ( John . David . Stone ) . QIAO HAI YAN CENG LIE KANG YI YI
Language: Chinese
- Softcover
Seller: liu xing, Nanjing, JS, Chinaliu xing
Contact seller5-star sellerCondition: New
£ 102.71
£ 13.52 shippingShips from China to U.S.A.Quantity: 3 available
paperback. Condition: New. Paperback. Pub Date: 2020-05-01 Pages: 276 Publisher: Machinery Industry Press This book introduces a variety of widely used algorithms. expressing them in a pure functional programming language. so that readers can understand their structure and operation more clearly .?In Chapter 1. the special symbo…ls that make up the format variants used are introduced.?Chapter 2 introduces many simpler and more general patterns in functional programming.?Chapters 3 to 7 introduce and explain data structu.
- More images
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 31.59
£ 51.96 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! In cryptography, the Tiny Encryption Algorithm (TEA) is a block cipher notable for its simplicity of description and implementation (typically a few lines of code). It was designed by David Whe…eler and Roger Needham of the Cambridge Computer Laboratory; it was first presented at the Fast Software Encryption workshop in Leuven in 1994, and first published in the proceedings of that workshop. TEA operates on 64-bit blocks and uses a 128-bit key. It has a Feistel structure with a suggested 64 rounds, typically implemented in pairs termed cycles. It has an extremely simple key schedule, mixing all of the key material in exactly the same way for each cycle. Different multiples of a magic constant are used to prevent simple attacks based on the symmetry of the rounds. The magic constant, 2654435769 or 9E3779B916 is chosen to be 232/ , where is the golden ratio.
- More images
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 35.72
£ 52.04 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computability theory the smn theorem, (also called the translation lemma, parameter theorem, or parameteri…zation theorem) is a basic result about programming languages (and, more generally, Gödel numberings of the computable functions) (Soare 1987, Rogers 1967). It was first proved by Stephen Cole Kleene (Kleene 1943). In practical terms, the theorem says that for a given programming language and positive integers m and n, there is a particular algorithm that operates on the source code of programs with m+n free variables. This algorithm effectively binds m given values to the first m free variables in the program and leaves the rest free.
- More images
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 35.72
£ 52.14 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! The Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of hidden states called the Viterbi path that results in a sequence of observed events, especially…in the context of Markov information sources, and more generally, hidden Markov models. The forward algorithm is a closely related algorithm for computing the probability of a sequence of observed events. These algorithms belong to the realm of information theory. The algorithm makes a number of assumptions. First, both the observed events and hidden events must be in a sequence. This sequence often corresponds to time. Second, these two sequences need to be aligned, and an instance of an observed event needs to correspond to exactly one instance of a hidden event. Third, computing the most likely hidden sequence up to a certain point t must depend only on the observed event at point t, and the most likely sequence at point t 1. These assumptions are all satisfied in a first-order hidden Markov model.
- More images
- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 83.09
£ 59.82 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Genetic algorithm | Genetic representation, Genetic programming, Algorithmic efficiency, Global optimization, Evolutionary algorithm, Fitness function, Selection (genetic algorithm), Crossover (genetic algorithm) | Frederic P. Miller (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 978613…0211790 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.
- More images
- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 96.70
£ 59.82 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Tiny Encryption Algorithm | Cryptography, Block Cipher, Patent, Key Schedule, Magic Number (programming), Hacker (computing), Cryptographic Hash Function, Chosen-plaintext Attack, Feistel Cipher, XXTEA | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130359034 | V…erantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.
- More images
- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 110.29
£ 59.82 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Viterbi Algorithm | Dynamic Programming, Algorithm, Likelihood Function, Markov Information Source, Hidden Markov Model, Information Theory, Error Detection and Correction | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130355128 | Verantwortliche Person für die…EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.
- More images
- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 110.29
£ 59.82 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Smn Theorem | Recursion Theory, Programming Language, Gödel Numbering, Computable Function, Stephen Cole Kleene, Algorithm | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131243431 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19…, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.
- More images
Published by Omniscriptum
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 40.67
£ 52.25 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! Discrete mathematics, also called finite mathematics, is the study of mathematical structures that are fundamentally discrete, in the sense of not supporting or requiring the notion of continui…ty. Most, if not all, of the objects studied in finite mathematics are countable sets, such as integers, finite graphs, and formal languages. Discrete mathematics has become popular in recent decades because of its applications to computer science. Concepts and notations from discrete mathematics are useful to study or describe objects or problems in computer algorithms and programming languages. In some mathematics curricula, finite mathematics courses cover discrete mathematical concepts for business, while discrete mathematics courses emphasize concepts for computer science majors. For contrast, see continuum, topology, and mathematical analysis.
- More images
Published by OmniScriptum, 2026
- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 126.67
£ 59.82 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Outline of Discrete Mathematics | Discrete Mathematics, Continuous Function, Countable Set, Integer, Formal Language, Computer Science, Algorithm, Programming Language, Mathematical Analysis | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130305949 | Verantwortli…che Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.
