You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work is in the "public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.
None
Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems,...
None
The satisfiability (SAT) problem is central in mathematical logic, computing theory, and many industrial applications. There has been a strong relationship between the theory, the algorithms and the applications of the SAT problem. This book aims to bring together work by the best theorists, algorithmists, and practitioners working on the sat problem and on industrial applications, as well as to enhance the interaction between the three research groups. The book features the applications of theoretical/algorithmic results to practical problems and presents practical examples for theoretical/algorithmic study. Major topics covered in the book include practical and industial SAT problems and benchmarks, significant case studies and applications of the SAT problem and SAT algorithms, new algorithms and improved techniques for satisfiability testing, specific data structures and implementation details of the SAT algorithms, and the theoretical study of the SAT problem and SAT algorithms.
This volume, containing the proceedings of IVA 2003, held at Kloster Irsee, in Germany, September 15–17, 2003, is testimony to the growing importance of IntelligentVirtualAgents(IVAs) asaresearch?eld.Wereceived67submissions, nearly twice as many as for IVA 2001, not only from European countries, but from China, Japan, and Korea, and both North and South America. As IVA research develops, a growing number of application areas and pl- forms are also being researched. Interface agents are used as part of larger - plications, often on the Web. Education applications draw on virtual actors and virtual drama, while the advent of 3D mobile computing and the convergence of telephones and PDAs produce geographically-aware guides and mobile - tertainment applications. A theme that will be apparent in a number of the papers in this volume is the impact of embodiment on IVA research – a char- teristic di?erentiating it to some extent from the larger ?eld of software agents.
The field of Artificial Intelligence in Education includes research and researchers from many areas of technology and social science. This study aims to open opportunities for the cross-fertilization of information and ideas from researchers in the many fields that make up this interdisciplinary research area.
None