
Sequential and parallel processing in depth search machines / Adam Kapralski
Tác giả : Adam Kapralski
Nhà xuất bản : World Scientific
Năm xuất bản : 1994
Nơi xuất bản : Singapore
Mô tả vật lý : xviii, 316 p. : ill. ; 23 cm
ISBN : 9810217161
Số phân loại : 004.3
Chủ đề : 1. Cơ sở dữ liệu tìm kiếm. 2. Xử lý song song ( máy tính điện tử ). 3. Xử lý tuần tự ( khoa học vi tính ). 4. Database searching. 5. Parallel processing (Electronic computers). 6. Sequential processing (Computer science). 7. Tiến trình hoạt động máy tính.
Thông tin chi tiết
Tóm tắt : | 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. |
Thông tin dữ liệu nguồn
Thư viện | Ký hiệu xếp giá | Dữ liệu nguồn |
---|---|---|
![]() |
|
https://lrcopac.ctu.edu.vn/pages/opac/wpid-detailbib-id-156840.html |