Narrow your search

Library

KU Leuven (6)

Odisee (6)

Thomas More Kempen (6)

Thomas More Mechelen (6)

ULB (6)

ULiège (6)

VIVES (6)

UCLL (5)

VUB (5)

AP (4)

More...

Resource type

book (12)

digital (4)


Language

English (16)


Year
From To Submit

2024 (1)

2021 (3)

2020 (3)

2019 (3)

2018 (2)

More...
Listing 1 - 10 of 16 << page
of 2
>>
Sort by

Book
First Course in Algorithms Through Puzzles
Author:
ISBN: 981133188X 9811331871 Year: 2019 Publisher: Singapore : Springer Singapore : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This textbook introduces basic algorithms and explains their analytical methods. All algorithms and methods introduced in this book are well known and frequently used in real programs. Intended to be self-contained, the contents start with the basic models, and no prerequisite knowledge is required. This book is appropriate for undergraduate students in computer science, mathematics, and engineering as a textbook, and is also appropriate for self-study by beginners who are interested in the fascinating field of algorithms. More than 40 exercises are distributed throughout the text, and their difficulty levels are indicated. Solutions and comments for all the exercises are provided in the last chapter. These detailed solutions will enable readers to follow the author’s steps to solve problems and to gain a better understanding of the contents. Although details of the proofs and the analyses of algorithms are also provided, the mathematical descriptions in this book are not beyond the range of high school mathematics. Some famous real puzzles are also used to describe the algorithms. These puzzles are quite suitable for explaining the basic techniques of algorithms, which show how to solve these puzzles.


Book
Introduction to Computational Origami : The World of New Computational Geometry
Author:
ISBN: 9811544700 9811544697 Year: 2020 Publisher: Singapore : Springer Singapore : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book focuses on origami from the point of view of computer science. Ranging from basic theorems to the latest research results, the book introduces the considerably new and fertile research field of computational origami as computer science. Part I introduces basic knowledge of the geometry of development, also called a net, of a solid. Part II further details the topic of nets. In the science of nets, there are numerous unresolved issues, and mathematical characterization and the development of efficient algorithms by computer are closely connected with each other. Part III discusses folding models and their computational complexity. When a folding model is fixed, to find efficient ways of folding is to propose efficient algorithms. If this is difficult, it is intractable in terms of computational complexity. This is, precisely, an area for computer science research. Part IV presents some of the latest research topics as advanced problems. Commentaries on all exercises included in the last chapter. The contents are organized in a self-contained way, and no previous knowledge is required. This book is suitable for undergraduate, graduate, and even high school students, as well as researchers and engineers interested in origami.


Digital
First Course in Algorithms Through Puzzles
Author:
ISBN: 9789811331886 Year: 2019 Publisher: Singapore Springer Singapore, Imprint: Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

This textbook introduces basic algorithms and explains their analytical methods. All algorithms and methods introduced in this book are well known and frequently used in real programs. Intended to be self-contained, the contents start with the basic models, and no prerequisite knowledge is required. This book is appropriate for undergraduate students in computer science, mathematics, and engineering as a textbook, and is also appropriate for self-study by beginners who are interested in the fascinating field of algorithms. More than 40 exercises are distributed throughout the text, and their difficulty levels are indicated. Solutions and comments for all the exercises are provided in the last chapter. These detailed solutions will enable readers to follow the author’s steps to solve problems and to gain a better understanding of the contents. Although details of the proofs and the analyses of algorithms are also provided, the mathematical descriptions in this book are not beyond the range of high school mathematics. Some famous real puzzles are also used to describe the algorithms. These puzzles are quite suitable for explaining the basic techniques of algorithms, which show how to solve these puzzles.


Digital
Introduction to Computational Origami : The World of New Computational Geometry
Author:
ISBN: 9789811544705 Year: 2020 Publisher: Singapore Springer Singapore, Imprint: Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book focuses on origami from the point of view of computer science. Ranging from basic theorems to the latest research results, the book introduces the considerably new and fertile research field of computational origami as computer science. Part I introduces basic knowledge of the geometry of development, also called a net, of a solid. Part II further details the topic of nets. In the science of nets, there are numerous unresolved issues, and mathematical characterization and the development of efficient algorithms by computer are closely connected with each other. Part III discusses folding models and their computational complexity. When a folding model is fixed, to find efficient ways of folding is to propose efficient algorithms. If this is difficult, it is intractable in terms of computational complexity. This is, precisely, an area for computer science research. Part IV presents some of the latest research topics as advanced problems. Commentaries on all exercises included in the last chapter. The contents are organized in a self-contained way, and no previous knowledge is required. This book is suitable for undergraduate, graduate, and even high school students, as well as researchers and engineers interested in origami.


Book
First Course in Algorithms Through Puzzles
Authors: ---
ISBN: 9789811331886 Year: 2019 Publisher: Singapore Springer Singapore :Imprint: Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract


Book
Introduction to Computational Origami
Authors: ---
ISBN: 9789811544705 Year: 2020 Publisher: Singapore Springer Singapore :Imprint: Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract


Book
WALCOM: Algorithms and Computation : Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings
Authors: --- ---
ISBN: 9783642002021 Year: 2009 Publisher: Berlin Heidelberg Springer Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the refereed proceedings of the Third International Workshop on Algorithms and Computation, WALCOM 2009, held in Kolkata, India, in February 2009. The 30 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 102 submissions. The papers feature original research in the areas of design and analysis of algorithms, computational geometry, graph drawing and graph algorithms. The papers are organized in topical sections on computational geometry, graph algorithms, complexity, graph drawing, approximation algorithms, and randomized algorithms.


Book
WALCOM : Algorithms and Computation
Authors: --- ---
ISBN: 9789819705665 Year: 2024 Publisher: Singapore : Springer Nature Singapore Pte Ltd.,

Loading...
Export citation

Choose an application

Bookmark

Abstract


Book
WALCOM: Algorithms and Computation : Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009, Proceedings
Authors: --- --- ---
ISBN: 3642002013 3642002021 Year: 2009 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the refereed proceedings of the Third International Workshop on Algorithms and Computation, WALCOM 2009, held in Kolkata, India, in February 2009. The 30 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 102 submissions. The papers feature original research in the areas of design and analysis of algorithms, computational geometry, graph drawing and graph algorithms. The papers are organized in topical sections on computational geometry, graph algorithms, complexity, graph drawing, approximation algorithms, and randomized algorithms.

Keywords

Computer algorithms --- Data structures (Computer science) --- Graph theory --- Computer Science --- Engineering & Applied Sciences --- Computer science. --- Computer communication systems. --- Algorithms. --- Numerical analysis. --- Computer science --- Computer graphics. --- Bioinformatics. --- Computer Science. --- Algorithm Analysis and Problem Complexity. --- Discrete Mathematics in Computer Science. --- Numeric Computing. --- Computer Communication Networks. --- Computer Graphics. --- Computational Biology/Bioinformatics. --- Mathematics. --- Bio-informatics --- Biological informatics --- Biology --- Information science --- Computational biology --- Systems biology --- Automatic drafting --- Graphic data processing --- Graphics, Computer --- Computer art --- Graphic arts --- Electronic data processing --- Engineering graphics --- Image processing --- Computer mathematics --- Discrete mathematics --- Mathematical analysis --- Algorism --- Algebra --- Arithmetic --- Communication systems, Computer --- Computer communication systems --- Data networks, Computer --- ECNs (Electronic communication networks) --- Electronic communication networks --- Networks, Computer --- Teleprocessing networks --- Data transmission systems --- Digital communications --- Electronic systems --- Information networks --- Telecommunication --- Cyberinfrastructure --- Network computers --- Informatics --- Science --- Data processing --- Digital techniques --- Mathematics --- Foundations --- Distributed processing --- Computer software. --- Computational complexity. --- Electronic data processing. --- ADP (Data processing) --- Automatic data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Complexity, Computational --- Machine theory --- Software, Computer --- Computer systems --- Automation --- Computer science—Mathematics. --- Discrete mathematics. --- Computer networks. --- Numerical Analysis. --- Computational and Systems Biology. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis


Book
WALCOM: Algorithms and Computation : 12th International Conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018, Proceedings
Authors: --- ---
ISBN: 3319751727 3319751719 Year: 2018 Publisher: Cham : Springer International Publishing : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the proceedings of the 12th International Workshop on Algorithms and Computation, WALCOM 2018, held in Dhaka, Bangladesh, in March 2018. The 22 full papers presented were carefully reviewed and selected from 50 submissions. The papers cover diverse areas of algorithms and computation, such as approximation algorithms, computational geometry, combinatorial algorithms, computational biology, computational complexity, data structures, graph and network algorithms, and online algorithms.

Keywords

Computer science. --- Data structures (Computer science). --- Algorithms. --- Numerical analysis. --- Computer science --- Mathematical statistics. --- Computer Science. --- Algorithm Analysis and Problem Complexity. --- Discrete Mathematics in Computer Science. --- Numeric Computing. --- Probability and Statistics in Computer Science. --- Data Structures. --- Mathematics. --- Mathematics --- Statistical inference --- Statistics, Mathematical --- Statistics --- Probabilities --- Sampling (Statistics) --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Mathematical analysis --- Algorism --- Algebra --- Arithmetic --- Informatics --- Science --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- File organization (Computer science) --- Abstract data types (Computer science) --- Statistical methods --- Foundations --- Computer software. --- Computational complexity. --- Electronic data processing. --- Data structures (Computer scienc. --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Complexity, Computational --- Machine theory --- Software, Computer --- Computer systems --- Automation --- Data structures (Computer science) --- Computer algorithms --- Computer science—Mathematics. --- Discrete mathematics. --- Artificial intelligence—Data processing. --- Numerical Analysis. --- Data Science. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis

Listing 1 - 10 of 16 << page
of 2
>>
Sort by