# krainaksiazek algorithms design and analysis 20128179

- znaleziono 73 produkty w 6 sklepach

### Algorithms: Design And Analysis

**Książki Obcojęzyczne>Angielskie>Computing & information technology>Computer science>Mathematical theory of computation>Maths for comput...**

Sklep: Gigant.pl

### Design And Analysis Of Algorithms

**Książki Obcojęzyczne>Niemieckie>Naturwissenschaften, Medizin, Informatik, Technik>Informatik, EDV>Programmiersprachen**

0x007ff2bd00000000

Sklep: Gigant.pl

### Analysis And Design Of Handoff Algorithms

**Książki Obcojęzyczne>Angielskie>Technology, engineering, agriculture>Electronics & communications engineering>Electronics engineering**

0x0157090200000000

Sklep: Gigant.pl

### Design And Analysis Of Algorithms

**Książki Obcojęzyczne>Angielskie>Computing & information technology>Information technology: general issues**

0x0152893600000000

Sklep: Gigant.pl

### Algorithms: Design And Analysis

**Książki Obcojęzyczne>Angielskie>Computing & information technology>Computer science>Mathematical theory of computation>Maths for comput...**

0x0179204a00000000

Sklep: Gigant.pl

### Introduction To The Design & Analysis Of Algorithms

**Książki Obcojęzyczne>Nieprzypisane**

0x000a6e7300000000

Sklep: Gigant.pl

### Design And Analysis Of Algorithms

**Książki Obcojęzyczne>Angielskie>Computing & information technology>Computer science**

0x01a6cd0100000000

Sklep: Gigant.pl

### Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Springer, Berlin

**Książki / Literatura obcojęzyczna**

This book constitutes the joint refereed proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2007 and the 11th International Workshop on Randomization and Computation, RANDOM 2007, held in Princeton, NJ, USA, in August 2007.§The 44 revised full papers presented were carefully reviewed and selected from 99 submissions. Topics of interest covered by the papers are design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, mathematical programming methods, coloring and partitioning, cuts and connectivity, geometric problems, game theory and applications, network design and routing, packing and covering, scheduling, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness and derandomization, random combinatorial structures, random walks/Markov chains, expander graphs and randomness extractors, probabilistic proof systems, random projections and embeddings, error-correcting codes, average-case analysis, property testing, computational learning theory, and other applications of approximation and randomness.

Sklep: Libristo.pl

### Approximation and Online Algorithms Springer, Berlin

**Książki / Literatura obcojęzyczna**

This book constitutes the thoroughly refereed post proceedings of the Second International Workshop on Approximation and Online Algorithms, WAOA 2004, held in Bergen, Norway in September 2004.§The 21 revised full papers presented together with 2 invited papers were carefully selected during two rounds of reviewing and improvement from 47 submissions. WAOA is devoted to the design and analysis of algorithms for online and computationally hard problems. Among the topics addressed are applications to game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric computations, inapproximability results, mechanism design, network design, routing, packing and covering, paradigms, randomization techniques, and scheduling problems.

Sklep: Libristo.pl

### Introduction to Algorithms The MIT Press

**Książki / Literatura obcojęzyczna**

Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called "Divide-and-Conquer"), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition. As of the third edition, this textbook is published exclusively by the MIT Press. The hardcover edition does not include a dust jacket.

Sklep: Libristo.pl

### Introduction to Algorithms The MIT Press

**Książki / Literatura obcojęzyczna**

Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called "Divide-and-Conquer"), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition. As of the third edition, this textbook is published exclusively by the MIT Press. The hardcover edition does not include a dust jacket.

Sklep: Libristo.pl

### Data Structures And Algorithms In Java

**Książki Obcojęzyczne>Angielskie>Computing & information technology>Computer programming / software development>Object-oriented programming...**

The Design And Analysis Of Efficient Data Structures Has Long Been Recognized As A Key Component Of The Computer Science Curriculum. Goodrich And Tomassia's Approach To This Classic Topic Is Based On The Object-oriented Paradigm As The Framework Of Choice For The Design Of Data Structures.

Sklep: Gigant.pl

### Graph Algorithms And Applications 2 World Scientific Publishing Co Pte Ltd

**Książki / Literatura obcojęzyczna**

This book contains Volumes 4 and 5 of the Journal of Graph Algorithms and Applications (JGAA). The first book of this series, Graph Algorithms and Applications 1, published in March 2002, contains Volumes 1-3 of JGAA. JGAA is a peer-reviewed scientific journal devoted to the publication of high-quality research papers on the analysis, design, implementation, and applications of graph algorithms. Areas of interest include computational biology, computational geometry, computer graphics, computer-aided design, computer and interconnection networks, constraint systems, databases, graph drawing, graph embedding and layout, knowledge representation, multimedia, software engineering, telecommunications networks, user interfaces and visualization, and VLSI circuit design. The journal is supported by distinguished advisory and editorial boards, has high scientific standards, and takes advantage of current electronic document technology. The electronic version of JGAA is available on the Web at http:/ /jgaa.info/. Graph Algorithms and Applications 2 presents contributions from prominent authors and includes selected papers from the Dagstuhl Seminar on Graph Algorithms and Applications and the Symposium on Graph Drawing in 1998. All papers in the book have extensive diagrams and offer a unique treatment of graph algorithms focusing on the important applications.

Sklep: Libristo.pl

### Frequency Domain Analysis and Design of Nonlinear Systems based on Volterra Series Expansion Springer, Berlin

**Książki / Literatura obcojęzyczna**

This book is a systematic summary of some new advances in the area of nonlinear analysis and design in the frequency domain, focusing on the application oriented theory and methods based on the GFRF concept, which is mainly done by the author in the past 8 years. The main results are formulated uniformly with a parametric characteristic approach, which provides a convenient and novel insight into nonlinear influence on system output response in terms of characteristic parameters and thus facilitate nonlinear analysis and design in the frequency domain. The book starts with a brief introduction to the background of nonlinear analysis in the frequency domain, followed by recursive algorithms for computation of GFRFs for different parametric models, and nonlinear output frequency properties. Thereafter the parametric characteristic analysis method is introduced, which leads to the new understanding and formulation of the GFRFs, and nonlinear characteristic output spectrum (nCOS) and the nCOS based analysis and design method. Based on the parametric characteristic approach, nonlinear influence in the frequency domain can be investigated with a novel insight, i.e., alternating series, which is followed by some application results in vibration control. Magnitude bounds of frequency response functions of nonlinear systems can also be studied with a parametric characteristic approach, which result in novel parametric convergence criteria for any given parametric nonlinear model whose input-output relationship allows a convergent Volterra series expansion. This book targets those readers who are working in the areas related to nonlinear analysis and design, nonlinear signal processing, nonlinear system identification, nonlinear vibration control, and so on. It particularly serves as a good reference for those who are studying frequency domain methods for nonlinear systems.

Sklep: Libristo.pl

## szukaj w Kangoo krainaksiazek algorithms design and analysis 20128179

Sklepy zlokalizowane w miastach: Warszawa, Kraków, Łódź, Wrocław, Poznań, Gdańsk, Szczecin, Bydgoszcz, Lublin, Katowice

# Szukaj w sklepach lub całym serwisie

## 1. Sklepy z krainaksiazek pl algorithms design and analysis 20128179

2. Szukaj na wszystkich stronach serwisu

t1=0.095, t2=0, t3=0, t4=0.019, t=0.095