Narrow your search

Library

ULB (3)

KU Leuven (2)

Odisee (2)

Thomas More Kempen (2)

Thomas More Mechelen (2)

UCLL (2)

ULiège (2)

VIVES (2)

Vlerick Business School (1)


Resource type

book (3)


Language

English (2)

German (1)


Year
From To Submit

2013 (1)

2010 (1)

2008 (1)

Listing 1 - 3 of 3
Sort by

Book
Algorithmic Game Theory : 6th International Symposium, SAGT 2013, Aachen, Germany, October 21-23, 2013, Proceedings
Author:
ISBN: 3642413919 3642413927 Year: 2013 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the proceedings of the 6th International Symposium on Algorithmic Game Theory, SAGT 2013, held in Aachen, Germany, in October 2013. The 25 papers presented in this volume were carefully reviewed and selected from 65 submissions. They cover various important aspects of algorithmic game theory, such as solution concepts in game theory, efficiency of equilibria and the price of anarchy, computational aspects of equilibria and game theoretical measures, repeated games and convergence of dynamics, evolution and learning in games, coordination and collective action, network games and graph-theoretic aspects of social networks, voting and social choice, as well as algorithmic mechanism design.

Keywords

Engineering & Applied Sciences --- Computer Science --- Computer science. --- Numerical analysis. --- Mathematical statistics. --- Computers. --- Computer simulation. --- Computers and civilization. --- E-commerce. --- Computer Science. --- Simulation and Modeling. --- e-Commerce/e-business. --- Models and Principles. --- Computers and Society. --- Numeric Computing. --- Probability and Statistics in Computer Science. --- Game theory --- Algorithms --- Electronic data processing. --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Informatics --- Science --- Computer modeling --- Computer models --- Modeling, Computer --- Models, Computer --- Simulation, Computer --- Electromechanical analogies --- Mathematical models --- Simulation methods --- Model-integrated computing --- Automation --- Cybercommerce --- E-business --- E-commerce --- E-tailing --- eBusiness --- eCommerce --- Electronic business --- Internet commerce --- Internet retailing --- Online commerce --- Web retailing --- Commerce --- Information superhighway --- Mathematical analysis --- Mathematics --- Statistical inference --- Statistics, Mathematical --- Statistics --- Probabilities --- Sampling (Statistics) --- Civilization and computers --- Civilization --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Statistical methods


Book
Algorithms unplugged
Author:
ISBN: 3642153275 9786613082350 3642153283 1283082357 Year: 2010 Publisher: Heidelberg : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Algorithms specify the way computers process information and how they execute tasks. Many recent technological innovations and achievements rely on algorithmic ideas – they facilitate new applications in science, medicine, production, logistics, traffic, communi¬cation and entertainment. Efficient algorithms not only enable your personal computer to execute the newest generation of games with features unimaginable only a few years ago, they are also key to several recent scientific breakthroughs – for example, the sequencing of the human genome would not have been possible without the invention of new algorithmic ideas that speed up computations by several orders of magnitude. The greatest improvements in the area of algorithms rely on beautiful ideas for tackling computational tasks more efficiently. The problems solved are not restricted to arithmetic tasks in a narrow sense but often relate to exciting questions of nonmathematical flavor, such as: How can I find the exit out of a maze? How can I partition a treasure map so that the treasure can only be found if all parts of the map are recombined? How should I plan my trip to minimize cost? Solving these challenging problems requires logical reasoning, geometric and combinatorial imagination, and, last but not least, creativity – the skills needed for the design and analysis of algorithms. In this book we present some of the most beautiful algorithmic ideas in 41 articles written in colloquial, nontechnical language. Most of the articles arose out of an initiative among German-language universities to communicate the fascination of algorithms and computer science to high school students. The book can be understood without any prior knowledge of algorithms and computing, and it will be an enlightening and fun read for students and interested adults.


Book
Taschenbuch der Algorithmen
Authors: --- --- --- --- --- et al.
ISBN: 3540763945 Year: 2008 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Hinter vielen Programmen stecken clevere Verfahren, die man als Algorithmen bezeichnet. Algorithmen lösen nicht nur mathematische Aufgaben, die sich mit Zahlen beschäftigen, sondern auch andere, ganz alltägliche Problemstellungen, bei denen logischer Spürsinn, räumliche Orientierung oder geschicktes Verhandeln gefragt sind, beispielsweise: Wie lässt sich der kürzeste Weg zwischen zwei Orten ermitteln? Wie sollten Seeräuber eine Schatzkarte aufteilen, bzw. Bankangestellte den Geheimcode des Tresors? Wie können mehrere hungrige Partygäste einen Kuchen gerecht untereinander aufteilen? Dieses Buch vollführt einen Streifzug durch die faszinierende Welt der Algorithmen. Es verlangt keine Vorkenntnisse, so dass Schüler ab der Mittelstufe und Informatik-interessierte Laien neue und überraschende Einblicke gewinnen können. In 43 Artikeln von Informatikern, die an Universitäten im In- und Ausland lehren, werden wichtige und besonders elegante Algorithmen anschaulich und umgangssprachlich erklärt.

Listing 1 - 3 of 3
Sort by