You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Dirk Jacob Jansen provides an overview of the life and career of the sixteenth-century cosmopolitan courtier, architect and antiquary Jacopo Strada.
Presents a detailed study of the major design components that constitute a top-down decision-tree induction algorithm, including aspects such as split criteria, stopping criteria, pruning and the approaches for dealing with missing values. Whereas the strategy still employed nowadays is to use a 'generic' decision-tree induction algorithm regardless of the data, the authors argue on the benefits that a bias-fitting strategy could bring to decision-tree induction, in which the ultimate goal is the automatic generation of a decision-tree induction algorithm tailored to the application domain of interest. For such, they discuss how one can effectively discover the most suitable set of components of decision-tree induction algorithms to deal with a wide variety of applications through the paradigm of evolutionary computation, following the emergence of a novel field called hyper-heuristics. "Automatic Design of Decision-Tree Induction Algorithms" would be highly useful for machine learning and evolutionary computation students and researchers alike.
In Herder: Aesthetics against Imperialism, John K. Noyes plumbs the connections between Herder s anti-imperialism, often acknowledged but rarely explored in depth, and his epistemological investigations."
Algorithms are essential building blocks of computer applications. However, advancements in computer hardware, which render traditional computer models more and more unrealistic, and an ever increasing demand for efficient solution to actual real world problems have led to a rising gap between classical algorithm theory and algorithmics in practice. The emerging discipline of Algorithm Engineering aims at bridging this gap. Driven by concrete applications, Algorithm Engineering complements theory by the benefits of experimentation and puts equal emphasis on all aspects arising during a cyclic solution process ranging from realistic modeling, design, analysis, robust and efficient implementat...
This unique reference weaves together the principles and theoretical models of parallel computing with the design, analysis, and application of algorithms for solving statistical problems. After a brief introduction to parallel computing, the book explores the architecture, programming, and computational aspects of parallel processing. Focus then t
This book elaborates upon the dynamic changes to Korean firms and the economy from the perspective of catch-up theory. The central premise of the book is that a latecomer’s sustained catch-up is not possible by simply following the path of the forerunners but by creating a new path or ‘leapfrogging’. In this sense, the idea of catch-up distinguishes itself from traditional views that focus on the role of the market or the state in development.
None
By explaining how to sire multicolored horses, produce nuts without shells, and create an egg the size of a human head, Giambattista Della Porta's Natural Magic (1559) conveys a fascination with tricks and illusions that makes it a work difficult for historians of science to take seriously. Yet, according to William Eamon, it is in the "how-to" books written by medieval alchemists, magicians, and artisans that modern science has its roots. These compilations of recipes on everything from parlor tricks through medical remedies to wool-dyeing fascinated medieval intellectuals because they promised access to esoteric "secrets of nature." In closely examining this rich but little-known source of literature, Eamon reveals that printing technology and popular culture had as great, if not stronger, an impact on early modern science as did the traditional academic disciplines.
This book constitutes the refereed proceedings of the 14th International Symposium on Algorithms and Computation, ISAAC 2003, held in Kyoto, Japan, in December 2003. The 73 revised full papers presented were carefully reviewed and selected from 207 submissions. The papers are organized in topical sections on computational geometry, graph and combinatorial algorithms, computational complexity, quantum computing, combinatorial optimization, scheduling, computational biology, distributed and parallel algorithms, data structures, combinatorial and network optimization, computational complexity and cryptography, game theory and randomized algorithms, and algebraic and arithmetic computation.
This book provides a unified approach for developing a fuzzy classifier and explains the advantages and disadvantages of different classifiers through extensive performance evaluation of real data sets. It thus offers new learning paradigms for analyzing neural networks and fuzzy systems, while training fuzzy classifiers. Function approximation is also treated and function approximators are compared.