Dòng Nội dung
1
2
Algorithmic properties of structure : selected papers of Erwin Engeler / Erwin Engeler
Singapore : World Scientific, 1993
viii, 257 pages. : illustrations ; 26 cm.
Ký hiệu phân loại (DDC): 511.8
The volume begins with the area of enrichment of classical model theory by languages which express properties representing the outcome of hypothetical computer programs executed in a given class of mathematical structures, and is related to questions of correctness and provability of programs. This point of view allowed the generalization of classical Galois theory to the point of discussing the relation between structure and complexity of solution programs for problems posed in various mathematical theories.
Số bản sách: (10) Tài liệu số: (0)
3
Algorithms: Discover the computer science and artificial intelligence used to solve everyday human problems, optimize habits, learn anything and organize your life / Trust Genics
NY : Fortune Publishing, 2019
54 tr. : illustrations ; 23 cm.
Ký hiệu phân loại (DDC): 629
Algorithms can better predict human behavior than trained psychologists and with much simpler criteria. Studies continue to show that the algorithms can do a better job than experts in a range of fields. Artificial intelligence is reshaping health care, science, engineering, and life. The results will make our lives more productive, better organized, and essentially much happier.
Số bản sách: (0) Tài liệu số: (1)
4
Applied parallel computing / Yuefan Deng
Singapore : World Scientific, 2013
x, 207 pages. : illustrations ; 24 cm.
Ký hiệu phân loại (DDC): 004.35
This book provides a practical guide for computational scientists and engineers to help advance their research by exploiting the superpower of supercomputers with many processors and complex networks. It focuses on the design and analysis of basic parallel algorithms.
Số bản sách: (1) Tài liệu số: (0)
5
Approximation algorithms for NP-hard problems / Edited by Dorit S Hochbaum
Boston : PWS Pub. Co., 1997
596 p. ; 22 cm.
Ký hiệu phân loại (DDC): 511.42
Discussing approximation algorithms for n-p hard problems, this study details scheduling, connectivity problems, randomization in approximations, best possible results, and on-line and server problems.
Số bản sách: (1) Tài liệu số: (0)