Sequential and Parallel Processing in Depth Search Machines
Sequential and Parallel Processing in Depth Search Machines

Author: Adam Kapralski

Publisher: World Scientific

Published: 1994

Total Pages: 346

ISBN-13: 9789810217167

DOWNLOAD EBOOK

Depth search machines (DSMs) and their applications for processing combinatorial tasks are investigated and developed in this book. The combinatorial tasks are understood widely and contain sorting and searching, processing NP-complete and isomorphic complete problems, computational geometry, pattern recognition, image analysis and expert reasoning. The main philosophy is to see EXISTENCE and EVERY as the basic tasks, while IDENTIFICATION, SEARCHING and ALL algorithms are given both for single and parallel DSMs. In this book, many IDENTIFICATION, SEARCHING and ALL algorithms are performed in single and parallel DSMs. In order to support side applications of the given approach, there are many new models for representing different combinatorial problems. The given approach enables low computational complexity for many practical algorithms to be reached, which is theoretically quite unexpected if the classic approach is followed.

Sequential And Parallel Processing In Depth Search Machines
Sequential And Parallel Processing In Depth Search Machines

Author: Adam Kapralski

Publisher: World Scientific Publishing Company

Published: 1994-05-31

Total Pages: 339

ISBN-13: 9813104732

DOWNLOAD EBOOK

Depth search machines (DSMs) and their applications for processing combinatorial tasks are investigated and developed in this book. The combinatorial tasks are understood widely and contain sorting and searching, processing NP-complete and isomorphic complete problems, computational geometry, pattern recognition, image analysis and expert reasoning. The main philosophy is to see EXISTENCE and EVERY as the basic tasks, while IDENTIFICATION, SEARCHING and ALL algorithms are given both for single and parallel DSMs. In this book, many IDENTIFICATION, SEARCHING and ALL algorithms are performed in single and parallel DSMs. In order to support side applications of the given approach, there are many new models for representing different combinatorial problems. The given approach enables low computational complexity for many practical algorithms to be reached, which is theoretically quite unexpected if the classic approach is followed.

Parallel Processing and Applied Mathematics
Parallel Processing and Applied Mathematics

Author: Roman Wyrzykowski

Publisher: Springer Science & Business Media

Published: 2008-05-26

Total Pages: 1437

ISBN-13: 3540681051

DOWNLOAD EBOOK

This book constitutes the thoroughly refereed post-conference proceedings of the 7th International Conference on Parallel Processing and Applied Mathematics, PPAM 2007, held in Gdansk, Poland, in September 2007. The 63 revised full papers of the main conference presented together with 85 revised workshop papers were carefully reviewed and selected from over 250 initial submissions. The papers are organized in topical sections on parallel/distributed architectures and mobile computing, numerical algorithms and parallel numerics, parallel and distributed non-numerical algorithms, environments and tools for as well as applications of parallel/distributed/grid computing, evolutionary computing, meta-heuristics and neural networks. The volume proceeds with the outcome of 11 workshops and minisymposia dealing with novel data formats and algorithms for dense linear algebra computations, combinatorial tools for parallel sparse matrix computations, grid applications and middleware, large scale computations on grids, models, algorithms and methodologies for grid-enabled computing environments, scheduling for parallel computing, language-based parallel programming models, performance evaluation of parallel applications on large-scale systems, parallel computational biology, high performance computing for engineering applications, and the minisymposium on interval analysis.

Field-Programmable Logic and Applications: Reconfigurable Computing Is Going Mainstream
Field-Programmable Logic and Applications: Reconfigurable Computing Is Going Mainstream

Author: Manfred Glesner

Publisher: Springer

Published: 2003-08-02

Total Pages: 1209

ISBN-13: 3540461175

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 12th International Conference on Field-Programmable Logic and Applications, FPL 2002, held in Montpellier, France, in September 2002. The 104 revised regular papers and 27 poster papers presented together with three invited contributions were carefully reviewed and selected from 214 submissions. The papers are organized in topical sections on rapid prototyping, FPGA synthesis, custom computing engines, DSP applications, reconfigurable fabrics, dynamic reconfiguration, routing and placement, power estimation, synthesis issues, communication applications, new technologies, reconfigurable architectures, multimedia applications, FPGA-based arithmetic, reconfigurable processors, testing and fault-tolerance, crypto applications, multitasking, compilation techniques, etc.

并行程序设计
并行程序设计

Author: Foster

Publisher:

Published: 2002

Total Pages: 381

ISBN-13: 9787115103475

DOWNLOAD EBOOK

国外著名高等院校信息科学与技术优秀教材

Advances in Computer and Information Sciences '98
Advances in Computer and Information Sciences '98

Author: U. Gudukbay

Publisher: IOS Press

Published: 1998

Total Pages: 604

ISBN-13: 9789051994056

DOWNLOAD EBOOK

This volume includes very high quality papers in different areas of computer and information sciences. The main themes are (computer network) performance evaluation and artificial neural networks and their applications. The latest developments in these areas are presented by a number of distinguished researchers from all over the world. These proceedings of The 13th International Symposium on Computer and Information Sciences (ISCIS'98) contain outstanding papers specifically related to the areas of "Gelenbe" neural networks and their applications, performance of computer-communication networks, simulations and analytic methods in order to study the performance of telecommunication networks, scheduling and resource allocation in computer and multimedia systems, stochastic ordering applied to performance evaluation, and simulation of virtual humans.

STACS 94
STACS 94

Author: Patrice Enjalbert

Publisher: Springer Science & Business Media

Published: 1994-02-09

Total Pages: 802

ISBN-13: 9783540577850

DOWNLOAD EBOOK

This volume constitutes the proceedings of the 11th annual Symposium on Theoretical Aspects of Computer Science (STACS '94), held in Caen, France, February 24-26, 1994. Besides three prominent invited papers, the proceedings contains 60 accepted contributions chosen by the international program committee during a highly competitive reviewing process from a total of 234 submissions for 38 countries. The volume competently represents most areas of theoretical computer science with a certain emphasis on (parallel) algorithms and complexity.

Probability and Algorithms
Probability and Algorithms

Author: National Research Council

Publisher: National Academies Press

Published: 1992-02-01

Total Pages: 189

ISBN-13: 0309047765

DOWNLOAD EBOOK

Some of the hardest computational problems have been successfully attacked through the use of probabilistic algorithms, which have an element of randomness to them. Concepts from the field of probability are also increasingly useful in analyzing the performance of algorithms, broadening our understanding beyond that provided by the worst-case or average-case analyses. This book surveys both of these emerging areas on the interface of the mathematical sciences and computer science. It is designed to attract new researchers to this area and provide them with enough background to begin explorations of their own.

Limits to Parallel Computation
Limits to Parallel Computation

Author: Raymond Greenlaw

Publisher: Oxford University Press, USA

Published: 1995

Total Pages: 328

ISBN-13: 0195085914

DOWNLOAD EBOOK

This book provides a comprehensive analysis of the most important topics in parallel computation. It is written so that it may be used as a self-study guide to the field, and researchers in parallel computing will find it a useful reference for many years to come. The first half of the book consists of an introduction to many fundamental issues in parallel computing. The second half provides lists of P-complete- and open problems. These lists will have lasting value to researchers in both industry and academia. The lists of problems, with their corresponding remarks, the thorough index, and the hundreds of references add to the exceptional value of this resource. While the exciting field of parallel computation continues to expand rapidly, this book serves as a guide to research done through 1994 and also describes the fundamental concepts that new workers will need to know in coming years. It is intended for anyone interested in parallel computing, including senior level undergraduate students, graduate students, faculty, and people in industry. As an essential reference, the book will be needed in all academic libraries.