Libeskind hadas ran (13 Ergebnisse)

Zustand: New. pp. 217 41 Illus. (33 Col.).

Zustand: New. In.

Paperback. Zustand: Brand New. 288 pages. 9.10x7.50x0.70 inches. In Stock.

Zustand: New. Teaches life science students how to use Python programming and computational problem-solving in the context of compelling biological applications. Num Pages: 218 pages, 8 b/w illus. 33 colour illus. 1 table. BIC Classification: PSA; UY. Category: (U) Tertiary Education (US: College). Dimension: 190 x 248 x 9. Weight in Grams: 500. . 2014. Illustrated. paperback. . . . . Books ship from the US and Ireland. …

Zustand: As New.

Paperback. Zustand: Brand New. 207 pages. 9.50x7.50x0.50 inches. In Stock.

Paperback. Zustand: Brand New. 288 pages. 9.10x7.50x0.70 inches. In Stock.

Kluwer, Boston, 1992. XIII, 130 pages, hard cover----former library book in good condition- 434 Gramm.

Zustand: New. A unique approach to Intro CS. In a nutshell, the authors of this book s objective is to provide an introduction to computer science as an intellectually rich and vibrant field rather than focusing exclusively on computer programming.

Zustand: New. In English.

Taschenbuch. Zustand: Neu. Neuware - Here's a unique approach to 'Intro CS.' In a nutshell, this book's objective is to provide an introduction to computer science as an intellectually rich and vibrant field rather than focusing exclusively on computer programming. While programming is certainly an important and pervasive element of their approach, this book emphasizes concepts and problem-solving over syntax and programming language features.…

Zustand: New. In English.

Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Fault Covering Problems in Reconfigurable VLSI Systems describes the authors' recent research on reconfiguration problems for fault-tolerance in VLSI and WSI Systems. The book examines solutions to a number of reconfiguration problems. Efficient algorithms are given for tractable covering problems and general techniques are given for dealing with a large number of intractable covering problems. The book begins with an investigation of algorithms for the reconfiguration of large redundant memories. Next, a number of more general covering problems are considered and the complexity of these problems is analyzed. Finally, a general and uniform approach is proposed for solving a wide class of covering problems. The results and techniques described here will be useful to researchers and students working in this area. As such, the book serves as an excellent reference and may be used as the text for an advanced course on the topic.…