251-259 - Computer Science - Finding books in the library - Research Guides at Hebrew University of Jerusalem

חיפוש בקטלוג הספרייה

המלצת הספרייה

Nonlinear Programming by Dimitri P. Bertsekas
Call Number: 254.1 Be77 2004
ISBN: 9781886529007
Publication Date: 2004
This extensive rigorous textbook, developed through instruction at MIT, focuses on nonlinear and other types of optimization: iterative algorithms for constrained and unconstrained optimization, Lagrange multipliers and duality, large scale problems, and the interface between continuous and discrete optimization.
Linear Systems and Signals by B. P. Lathi
Call Number: 259 La74 2005
ISBN: 0195158334
Publication Date: 2005
Incorporating new problems and examples, the second edition of Linear Systems and Signals features MATLABRG material in each chapter and at the back of the book. It gives clear descriptions of linear systems and uses mathematics not only to prove axiomatic theory, but also to enhance physical and intuitive understanding.
Introduction to the Theory of Computation by Michael Sipser
Call Number: ONLINE and 252 Si66 2012
ISBN: 9781133187813
Publication Date: 2013
Gain a clear understanding of even the most complex, highly theoretical computational theory topics in the approachable presentation found only in the market-leading INTRODUCTION TO THE THEORY OF COMPUTATION, 3E. The number one choice for today's computational theory course, this revision continues the book's well-know, approachable style with timely revisions, additional practice, and more memorable examples in key areas.
Introduction to Algorithms, Fourth Edition by Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest; Clifford Stein
Call Number: ONLINE and 252.5 Co55 2022
ISBN: 9780262046305
Publication Date: 2022-04-05
הספר בעברית: מבוא לאלגוריתמים
A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics. New for the fourth edition: New chapters on matchings in bipartite graphs, online algorithms, and machine learning New material on topics including solving recurrence equations, hash tables, potential functions, and suffix arrays 140 new exercises and 22 new problems Reader feedback-informed improvements to old problems Clearer, more personal, and gender-neutral writing style Color added to improve visual presentation Notes, bibliography, and index updated to reflect developments in the field Website with new supplementary material Warning: Avoid counterfeit copies of Introduction to Algorithms by buying only from reputable retailers. Counterfeit and pirated copies are incomplete and contain errors.
Elements of Information Theory by Thomas M. Cover; Joy A. Thomas
Call Number: ONLINE and 256 Co84 2006
ISBN: 0471241954
Publication Date: 2006
The Second Edition of this fundamental textbook maintains the book's tradition of clear, thought-provoking instruction. Readers are provided once again with an instructive mix of mathematics, physics, statistics, and information theory. All the essential topics in information theory are covered in detail, including entropy, data compression, channel capacity, rate distortion, network information theory, and hypothesis testing.

Theory and mathematics of computing

251 Numerical analysis

251.1 Error analysis, Digital filters, Computer arithmetic

251.2 Function evaluation

251.3 Interpolation, Functional approximation

251.4 Linear algebra

251.5 Nonlinear equations, Functional equations

251.6 Numerical integration, Numerical differentiation

251.7 Ordinary differential equations, Partial differential equations

251.8 Integral equations

251.9 Parallel and distributed algorithms, High performance systems

252 Metatheory, Category

252.1 Logic, Formal systems

252.11 Boolean algebras

252.12 Theorem proving, Constraint satisfaction systems

252.13 Dynamic logic, Temporal logic

252.14 Petri Nets

252.2 Automata theory

252.21 Finite state automata

252.22 Cellular automata

252.23 Stochastic automata

252.24 Sequential machines

252.25 Tree Automata

252.3 Formal languages

252.4 Programs schemata, Semantics, Correctness, Program. specifications (see also 241.8)

252.5 Computational complexity, Efficiency of algorithms, Algorithmic randomness

252.6 Algorithmic game theory, Algorithmic mechanism design, Algorithmic social choice, Electronic commerce

252.7 Computability, Unsolvability, Recursive functions

252.8 Rewriting systems, Graph reductions

253 Combinatorial mathematics, Discrete mathematics

253.1 Sorting

253.2 Graph theory, Graph algorithms

254 Mathematical programming

254.1 Linear programming, Non-linear programming, Dynamic programming, Network flows. (see also 93)

254.2 Optimization of application programs, Annealing. (see also 86)

255 Probability, Statistics

255.4 Monte-Carlo methods

256 Digital communications, Information theory, Coding, Data compression

256.1 Digital and analog communications--General

256.2 Information theory

256.3 Coding

256.4 Data compression

257 Symbolic algebraic computations

258 Cybernetics

258.1 Neural networks

258.2 Perception, Cognitive science

259 Systems and control theory

259.1 Linear systems

259.2 Nonlinear and complex systems

259.3 Control systems and theory

259.31 Feedback control systems

259.32 Digital control systems

259.33 Adaptive and fuzzy control

259.34 Process control

259.35 Optimal control

Computer Science - Finding books in the library: 251-259

חיפוש בקטלוג הספרייה

המלצת הספרייה

Theory and mathematics of computing