Narrow your search

Library

KU Leuven (7429)

ULiège (5159)

ULB (5051)

VIVES (4911)

Thomas More Mechelen (4888)

Odisee (4219)

Thomas More Kempen (4153)

UCLL (4134)

Hogeschool West-Vlaanderen (3676)

UGent (2295)

More...

Resource type

book (7998)

dissertation (464)

periodical (233)

object (72)

undetermined (6)

More...

Language

English (7877)

Dutch (319)

German (208)

French (198)

Undetermined (41)

More...

Year
From To Submit

2021 (35)

2020 (148)

2019 (224)

2018 (243)

2017 (304)

More...
Listing 1 - 10 of 8684 << page
of 869
>>
Sort by
Fundamentals of algorithmics
Authors: ---
ISBN: 013073487X 0133350681 Year: 1996 Publisher: Englewood Cliffs (N.J.) : Prentice Hall

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

Algorithms.


Object
The theory of algorithms
Author:
Year: 1971 Volume: 42 Publisher: Jerusalem : Israel program for scientific translations,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

Algorithms


Book
Description d'un algorithme d'analyse documentaire
Authors: --- ---
Year: 1963 Publisher: [Bruxelles] : Euratom,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

Algorithms.


Book
Algorithmische Mathematik
Authors: ---
ISBN: 3662470144 Year: 2016 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer Spektrum,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Algorithmen spielen eine immer wichtigere Rolle in fast allen Bereichen der Mathematik. Dieses Lehrbuch eignet sich für den Studienbeginn und stellt den klassischen Vorlesungen über Analysis und Lineare Algebra eine dritte mathematische Grundvorlesung zur Seite, die die Autoren in den letzten Jahren mehrfach an der Universität Bonn gehalten haben. Ziel dieses Werkes ist die Vermittlung grundlegender mathematischer Fähigkeiten, besonders im Hinblick auf Entwurf und Analyse von Algorithmen, sowie deren Implementierung. Neben einigen fundamentalen Algorithmen (z.B. Sieb des Eratosthenes, Euklidischer Algorithmus, Sortieralgorithmen, Algorithmen auf Graphen, Gauß-Elimination) werden auch elementare Datenstrukturen, graphentheoretische Grundlagen und numerische Fragen behandelt. Zudem werden grundlegende Programmierkenntnisse vermittelt, und es wird gezeigt, wie man Algorithmen in C++ implementiert. Die Autoren: Prof. Dr. Stefan Hougardy, Universität Bonn, Forschungsinstitut für Diskrete Mathematik Prof. Dr. Jens Vygen, Universität Bonn, Forschungsinstitut für Diskrete Mathematik.

Keywords

Algorithms.


Periodical
Algorithms.
Author:
Year: 2008 Publisher: Basel, Switzerland : Molecular Diversity Preservation International

Loading...
Export citation

Choose an application

Bookmark

Abstract


Book
Algorithms : the building blocks of computer programming
Author:
ISBN: 1538331306 Year: 2019 Publisher: New York : PowerKids Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract


Book
Algorithms unlocked
Authors: ---
ISBN: 9780262518802 9780262313223 Year: 2013 Publisher: Cambridge, Massachusetts : [Piscataqay, New Jersey] : MIT Press, IEEE Xplore,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. And how do these mathematical formulations translate themselves into your GPS, your laptop, or your smart phone? This book offers an engagingly written guide to the basics of computer algorithms. In Algorithms Unlocked, Thomas Cormen -- coauthor of the leading college textbook on the subject -- provides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems. Readers will learn what computer algorithms are, how to describe them, and how to evaluate them. They will discover simple ways to search for information in a computer; methods for rearranging information in a computer into a prescribed order ("sorting"); how to solve basic problems that can be modeled in a computer with a mathematical structure called a "graph" (useful for modeling road networks, dependencies among tasks, and financial relationships); how to solve problems that ask questions about strings of characters such as DNA structures; the basic principles behind cryptography; fundamentals of data compression; and even that there are some problems that no one has figured out how to solve on a computer in a reasonable amount of time.


Book
Algorithms unlocked
Authors: ---
ISBN: 1299284272 0262313227 9780262313223 9780262518802 0262518805 9780262313230 0262313235 9781299284272 Year: 2013 Publisher: Cambridge, Massachusetts : [Piscataqay, New Jersey] : MIT Press, IEEE Xplore,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. And how do these mathematical formulations translate themselves into your GPS, your laptop, or your smart phone? This book offers an engagingly written guide to the basics of computer algorithms. In Algorithms Unlocked, Thomas Cormen -- coauthor of the leading college textbook on the subject -- provides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems. Readers will learn what computer algorithms are, how to describe them, and how to evaluate them. They will discover simple ways to search for information in a computer; methods for rearranging information in a computer into a prescribed order ("sorting"); how to solve basic problems that can be modeled in a computer with a mathematical structure called a "graph" (useful for modeling road networks, dependencies among tasks, and financial relationships); how to solve problems that ask questions about strings of characters such as DNA structures; the basic principles behind cryptography; fundamentals of data compression; and even that there are some problems that no one has figured out how to solve on a computer in a reasonable amount of time.


Book
From digital traces to algorithmic projections
Authors: ---
ISBN: 0081023693 178548270X 9780081023693 9781785482700 Year: 2018 Publisher: London, England : ISTE Press : Elsevier,

Loading...
Export citation

Choose an application

Bookmark

Abstract


Book
Algorithms
Author:
ISBN: 9780262358675 0262358670 0262358662 9780262358668 0262539020 9780262539029 Year: 2019 Publisher: Cambridge, Massachusetts : The MIT Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

"This book is an introduction to algorithms targeting an audience with little to no computer science background. In this book, algorithms from a wide area are presented: from music to searching and sorting, to deep learning, to graphs. The author shows how algorithms are used in practice. A unique feature of the book is that it focuses on showing how algorithms really work; not just what algorithms can do. There are many books discussing that and delving in technological applications and their implications. The book aims to show not just what algorithms can do, but how they do it. Louridas covers a wide range of algorithms. He does not shy away from classic algorithms such as searching and sorting, as they are the workhorses of most applications; at the same time, he also covers a wide expanse, such as algorithms in music, non-traditional searching (like the secretary problem), graphs, and the PageRank algorithm. He introduces deep learning, showing how it works in practice, and gives an overview of the limits of computability. He finishes up the text with an eclectic discussion of implications. Most books on algorithms are either too technical, or not technical at all - showing what the algorithms do, without showing how. This book aims at striking a balance between the two methods. Algorithms should be, and can be explained, in simple terms. To repeat, an algorithm should be explained so that a human can execute it with a pen and paper"--

Listing 1 - 10 of 8684 << page
of 869
>>
Sort by