Skip to main content

Shopping Cart

You're getting the VIP treatment!

Item(s) unavailable for purchase
Please review your cart. You can remove the unavailable item(s) now or we'll automatically remove it at Checkout.
itemsitem
itemsitem

Recommended For You

Loading...
  • Decision Trees with Hypotheses

    Series series Synthesis Lectures on Intelligent Technologies
    In this book, the concept of a hypothesis about the values of all attributes is added to the standard decision tree model, considered, in particular, in test theory and rough set theory. This extension allows us to use the analog of equivalence queries from exact learning and explore decision trees that are based on various combinations of attributes, hypotheses, and proper hypotheses (analog of ... Read more

    $143.99 USD

  • Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions

    Series series Intelligent Technologies and Robotics (R0)
    The results presented here (including the assessment of a new tool – inhibitory trees) offer valuable tools for researchers in the areas of data mining, knowledge discovery, and machine learning, especially those whose work involves decision tables with many-valued decisions. The authors consider various examples of problems and corresponding decision tables with many-valued decisions, discuss the ... Read more

    $89.09 USD

  • Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

    Series series Intelligent Technologies and Robotics (R0)
    Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional dynamic programming algorithm returns an optimal object from a given set of objects. This book develops extensions of dynamic programming, enabling us to (i) describe the ... Read more

    $89.09 USD

People who read these also enjoyed

  • Computational Complexity

    A Modern Approach

    This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and ... Read more

    $65.59 USD

  • Handbook of Process Algebra

    Process Algebra is a formal description technique for complex computer systems, especially those involving communicating, concurrently executing components. It is a subject that concurrently touches many topic areas of computer science and discrete math, including system design notations, logic, concurrency theory, specification and verification, operational semantics, algorithms, complexity ... Read more

    $305.99 USD

  • Handbook of Constraint Programming

    Series series Foundations of Artificial Intelligence
    Constraint programming is a powerful paradigm for solving combinatorial search problems that draws on a wide range of techniques from artificial intelligence, computer science, databases, programming languages, and operations research. Constraint programming is currently applied with success to many domains, such as scheduling, planning, vehicle routing, configuration, networks, and bioinformatics ... Read more

    $193.49 USD

  • Tools and Algorithms for the Construction and Analysis of Systems

    25th International Conference, TACAS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings, Part II

    Edited by Tomáš Vojnar, Lijun Zhang ...
    Series Book 2 - Springer Nature Proceedings Computer Science
    This book is Open Access under a CC BY licence.The LNCS 11427 and 11428 proceedings set constitutes the proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2019, which took place in Prague, Czech Republic, in April 2019, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019.The total of ... Read more

    Free

  • The Design of Approximation Algorithms

    Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. This book shows how to design approximation algorithms: efficient ... Read more

    $69.69 USD

  • Bent Functions

    Results and Applications to Cryptography

    Bent Functions: Results and Applications to Cryptography offers a unique survey of the objects of discrete mathematics known as Boolean bent functions. As these maximal, nonlinear Boolean functions and their generalizations have many theoretical and practical applications in combinatorics, coding theory, and cryptography, the text provides a detailed survey of their main results, presenting a ... Read more

    $67.49 USD

  • Channel Coding: Theory, Algorithms, and Applications

    Academic Press Library in Mobile and Wireless Communications

    This book gives a review of the principles, methods and techniques of important and emerging research topics and technologies in Channel Coding, including theory, algorithms, and applications. Edited by leading people in the field who, through their reputation, have been able to commission experts to write on a particular topic. With this reference source you will: - Quickly grasp a new area of ... Read more

    $157.49 USD

  • Dynamic Programming Multi-Objective Combinatorial Optimization

    Series Book 331 - Studies in Systems, Decision and Control
    This book introduces a fairly universal approach to the design and analysis of exact optimization algorithms for multi-objective combinatorial optimization problems. It proposes the circuits without repetitions representing the sets of feasible solutions along with the increasing and strictly increasing cost functions as a model for such problems. The book designs the algorithms for multi-stage ... Read more

    $152.09 USD

  • Computer Aided Verification

    29th International Conference, CAV 2017, Heidelberg, Germany, July 24-28, 2017, Proceedings, Part II

    Series Book 2 - Springer Nature Proceedings Computer Science
    The two-volume set LNCS 10426 and LNCS 10427 constitutes the refereed proceedings of the 29th International Conference on Computer Aided Verification, CAV 2017, held in Heidelberg, Germany, in July 2017.The total of 50 full and 7 short papers presented together with 5 keynotes and tutorials in the proceedings was carefully reviewed and selected from 191 submissions.The CAV conference series is ... Read more

    $49.99 USD