Get Free Shipping on orders over $79
Sequential and Parallel Processing in Depth Search Machines - Adam Kapralski

Sequential and Parallel Processing in Depth Search Machines

By: Adam Kapralski

eText | 31 May 1994

At a Glance

eText


$50.60

or 4 interest-free payments of $12.65 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

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.

on
Desktop
Tablet
Mobile

More in Computer Science

Amazon.com : Get Big Fast - Robert Spector

eBOOK

AI-Powered Search - Trey Grainger

eBOOK

Tissue Proteomics : Methods and Protocols - Taufika Islam Williams

eBOOK

RRP $369.00

$332.99

10%
OFF

This product is categorised by