SØG - mellem flere end 8 millioner bøger:
Viser: Generic Data Structures and Algorithms in Go - An Applied Approach Using Concurrency, Genericity and Heuristics
Generic Data Structures and Algorithms in Go Vital Source e-bog
Richard Wiener
(2022)
Generic Data Structures and Algorithms in Go Vital Source e-bog
Richard Wiener
(2022)
Generic Data Structures and Algorithms in Go Vital Source e-bog
Richard Wiener
(2022)
Generic Data Structures and Algorithms in Go Vital Source e-bog
Richard Wiener
(2022)
Generic Data Structures and Algorithms in Go
An Applied Approach Using Concurrency, Genericity and Heuristics
Richard Wiener
(2022)
Sprog: Engelsk
Detaljer om varen
- Vital Source 180 day rentals (dynamic pages)
- Udgiver: Springer Nature (Juli 2022)
- ISBN: 9781484281918R180
Bookshelf online: 180 dage fra købsdato.
Bookshelf appen: 180 dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Detaljer om varen
- Vital Source 90 day rentals (dynamic pages)
- Udgiver: Springer Nature (Juli 2022)
- ISBN: 9781484281918R90
Bookshelf online: 90 dage fra købsdato.
Bookshelf appen: 90 dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Detaljer om varen
- Vital Source searchable e-book (Reflowable pages)
- Udgiver: Springer Nature (Juli 2022)
- ISBN: 9781484281918
Bookshelf online: 5 år fra købsdato.
Bookshelf appen: ubegrænset dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Detaljer om varen
- Vital Source 365 day rentals (dynamic pages)
- Udgiver: Springer Nature (Juli 2022)
- ISBN: 9781484281918R365
Bookshelf online: 5 år fra købsdato.
Bookshelf appen: 5 år fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Detaljer om varen
- Paperback
- Udgiver: Apress L. P. (Juli 2022)
- ISBN: 9781484281901
The presentation of classic data structures and techniques of algorithm design (greedy, divide and conquer, branch-and-bound to name a few) provides an essential foundation and toolkit for problem solving. But we go further in this book. We present heuristic algorithms and their implementations for solving computationally intractable combinatoric optimization problems such as the travelling salesperson problem. Ant colony optimization and simulated annealing are among the techniques used.
The consistent style of coding used throughout this book exploits Go's ability to implement abstract, generic and constrained generic data types without the use of classes. Although some familiarity with Go is assumed, this book should advance your ability to use Go to tackle server-side applications, games, machine learning, information retrieval and other application domains where speed and storage efficiency is essential.
What you'll learn:
- Explore classical data structures and algorithms aimed at making your applications run faster or require less storage
- Use the new generic features of Go to build reusable data structures
- Utilize concurrency for maximizing application performance
- See the power of heuristic algorithms for computationally intractable problems
- Enhance and improve your Go programming skills
This book is aimed at practicing Go software developers and students who wish to advance their programming and problem-solving skills and experience the excitement and see the benefits of using generic data structures and algorithms that utilize concurrency whenever possible.
2. Algorithm Efficiency - Sorting and Searching
3. Abstract Data Types: OOP Without Classes in Go
4. ADT In Action: Game Of Life
5. Stacks
6. Queues and Lists
7. Hash Tables
8. Binary Trees
9. Binary Search Tree
10. AVL Trees
11. Heap Trees
12. Red Black Trees
13. Expression Trees
14. Ecological Simulation With Concurrency
15. Dynamic Programming
16. Graph Structures
17. Travelling Salesperson Problem
18. Branch and Bound Solution to TSP
19. Simulated Annealing Heuristic Solution to TSP
20. Genetic Algorithm for TSP
21. Neural Networks and Machine Learning.