Eye Tracking Methodology: Theory and Practice, Duchowski Andrew T.

Ñòàðîå èçäàíèå

Àâòîð: Nedjah Nadia, Mourelle Luiza de Macedo Íàçâàíèå: Evolvable Machines / Theory & Practice ISBN: 3540229051 ISBN-13(EAN): 9783540229056 Èçäàòåëüñòâî: Springer Ðåéòèíã: Öåíà: 15894 ð. Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç.

Îïèñàíèå: Methods for the artificial evolution of active components, such as programs and hardware, are rapidly developing branches of adaptive computation and adaptive engineering. Evolvable Machines reports innovative and significant progress in automatic and evolutionary methodology applied to machine design. This book presents theoretical as well as practical chapters concentrating on Evolvable Robots, Evolvable Hardware Synthesis, as well as Evolvable Design.

Îïèñàíèå: This volume provides a snapshot of the current state of the art in data mining, presenting it both in terms of technical developments and industrial applications. The collection of chapters is based on works presented at the Australasian Data Mining conferences and industrial forums. Authors include some of Australia's leading researchers and practitioners in data mining. The volume also contains chapters by regional and international authors. The original papers were initially reviewed for the workshops, conferences and forums.The 25 articles in this state-of-the-art survey were carefully reviewed and selected from numerous contributions during at least two rounds of reviewing and improvement for inclusion in the book. They provide an interesting and broad update on current research and development in data mining. The book is divided into two parts. It starts with state-of-the-art research papers organized in topical sections on methodological advances, data linkage, text mining, and temporal and sequence mining. The second part comprises papers on state-of-the-art industrial applications from the fields of health, finance and retail.

Îïèñàíèå: Inference control in statistical databases, also known as statistical disclosure limitation or statistical confidentiality, is about finding tradeoffs to the tension between the increasing societal need for accurate statistical data and the legal and ethical obligation to protect privacy of individuals and enterprises which are the source of data for producing statistics. Techniques used by intruders to make inferences compromising privacy increasingly draw on data mining, record linkage, knowledge discovery, and data analysis and thus statistical inference control becomes an integral part of computer science.This coherent state-of-the-art survey presents some of the most recent work in the field. The papers presented together with an introduction are organized in topical sections on tabular data protection, microdata protection, and software and user case studies.

Îïèñàíèå: This book constitutes the thoroughly refereed post-proceedings of the Second Workshop of Central and Eastern Europe on Multi-Agent Systems, CEEMAS 2001, held in Cracow, Poland, in September 2001.The 33 revised full papers presented together with two invited papers were carefully selected during two rounds of reviewing and improvement. The papers address:- organizational and social aspects of MAS;- communication languages, protocols, and negotiation;- applications of MAS in various fields;- agent and multi-agent development tools;- theoretical foundations of DAI;- learning in MAS.

Îïèñàíèå: This book constitutes the thoroughly refereed post-proceedings of the Third International Conference on Practice and Theory of Automated Timetabling, PATAT 2000, held in Konstanz, Germany, in August 2000.The 22 revised full papers were carefully selected after two rounds of reviewing and revision. Besides foundational and methodological issues from combinatorics, optimization, evolutionary computing, genetic algorithms, planning, constraints, searching, etc., a variety of application fields are addressed including course and school timetabling, examination timetabling, employee timetabling, and fleet scheduling.

Àâòîð: Newborn Monty Íàçâàíèå: Automated Theorem Proving / Theory and Practice ISBN: 0387950753 ISBN-13(EAN): 9780387950754 Èçäàòåëüñòâî: Springer Ðåéòèíã: Öåíà: 17297 ð. Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç.

Îïèñàíèå: A brief introduction to COMPILE, HERBY and THEO.- Predicate calculus, well-formed formulas and theorems.- COMPILE: transforming well-formed formulas to clauses.- Inference procedures.- Proving theorems by constructing closed semantic trees.- Resolution-refutation proofs.- HERBY: A semantic tree theorem prover.- Using HERBY.- THEO: A resolution-refutation theorem prover.- Using THEO.- A look at HERBY's source code.- A look at THEO's source code.- Other theorem provers.- References.

Àâòîð: Rick Riolo; Terence Soule; Bill Worzel Íàçâàíèå: Genetic Programming Theory and Practice V ISBN: 0387763074 ISBN-13(EAN): 9780387763071 Èçäàòåëüñòâî: Springer Ðåéòèíã: Öåíà: 13089 ð. Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç.

Îïèñàíèå: Genetic Programming Theory and Practice V was developed from the fifth workshop at the University of Michigan`s Center for the Study of Complex Systems. This volume is a unique and indispensable tool for academics, researchers and industry professionals involved in GP, evolutionary computation, machine learning and artificial intelligence.

Îïèñàíèå: This book constitutes the refereed proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2002, held in Milovy, Czech Republic, in November 2002.The volume presents 10 invited lectures and the report on a panel discussion on GRID computing together with 11 revised full papers selected from 22 submissions. Among the topics covered are system design and testing related theory, distributed and parallel systems, type theory, multimedia, databases, computer vision, and soft computing.

Àâòîð: Schwefel Hans-Paul, Wegener Ingo, Weinert Klaus Íàçâàíèå: Advances in Computational Intelligence / Theory and Practice ISBN: 3540432698 ISBN-13(EAN): 9783540432692 Èçäàòåëüñòâî: Springer Ðåéòèíã: Öåíà: 13557 ð. Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç.

Îïèñàíèå: In this book, comprising recent research of leading researchers, a broad variety of problems is introduced, motivated, and then new results on these problems are presented. This handbook-like volume is for readers with theoretical as well as practical background knowledge about Computational Intelligence.

Àâòîð: Rick Riolo; Terence Soule; Bill Worzel (Eds.) Íàçâàíèå: Genetic Programming Theory and Practice VI ISBN: 0387876227 ISBN-13(EAN): 9780387876221 Èçäàòåëüñòâî: Springer Ðåéòèíã: Öåíà: 13089 ð. Íàëè÷èå íà ñêëàäå: Åñòü ó ïîñòàâùèêà Ïîñòàâêà ïîä çàêàç.

Îïèñàíèå: Explores the synergy between theory and practice, producing a comprehensive view of the research in GP application. This work addresses several interdependent themes, including: sustaining the long-term evolvability of our GP systems; exploiting discovered subsolutions for reuse; and, increasing the role of a Domain Expert.

Îïèñàíèå: This book constitutes the refereed proceedings of the 11th International Conference on Compiler Construction, CC 2002, held in Grenoble, France, in April 2002.The 19 revised full papers presented together with three tool demonstration papers and an invited paper were carefully reviewed and selected from 44 submissions. The papers are organized in topical sections on analysis and optimization, low-level analysis, grammars and parsing, domain-specific languages and tools, energy consumption optimizations, and loop and array optimizations.

Îïèñàíèå: Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground in linear programming theory. The book draws on the research developments in three broad areas: linear and integer programming, numerical analysis, and the computational architectures which enable speedy, high-level algorithm design. During the last ten years, a new body of research within the field of optimization research has emerged, which seeks to develop good approximation algorithms for classes of linear programming problems. This work both has roots in fundamental areas of mathematical programming and is also framed in the context of the modern theory of algorithms. The result of this work, in which Daniel Bienstock has been very much involved, has been a family of algorithms with solid theoretical foundations and with growing experimental success. This book will examine these algorithms, starting with some of the very earliest examples, and through the latest theoretical and computational developments.