Encyclopedia of Algorithms
Editat de Ming-Yang Kaoen Limba Engleză Electronic book text – 6 iul 2008
Preț: 1494.35 lei
Preț vechi: 1867.94 lei
-20% Nou
Puncte Express: 2242
Preț estimativ în valută:
286.19€ • 294.86$ • 239.74£
286.19€ • 294.86$ • 239.74£
Indisponibil temporar
Doresc să fiu notificat când acest titlu va fi disponibil:
Se trimite...
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780387301624
ISBN-10: 0387301623
Dimensiuni: 193 x 260 mm
Ediția:2008
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States
ISBN-10: 0387301623
Dimensiuni: 193 x 260 mm
Ediția:2008
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States
Public țintă
Professional/practitionerDescriere
The
Encyclopedia
of
Algorithms
will
provide
a
comprehensive
set
of
solutions
to
important
algorithmic
problems
for
students
and
researchers
interested
in
quickly
locating
useful
information.
The
first
edition
of
the
reference
will
focus
on
high-impact
solutions
from
the
most
recent
decade;
later
editions
will
widen
the
scope
of
the
work.
Nearly 500 entries will be organized alphabetically by problem, with subentries allowing for distinct solutions and special cases to be listed by the year. An entry will include:
This defining reference will be published in print and on line. The print publication will include an index of subjects and authors as well as a chronology for locating recent solutions. The online edition will supplement this index with hyperlinks as well as include hyperlinks in the text of the entries to related entries, xRefer citations, and other useful URLs mentioned above.
Nearly 500 entries will be organized alphabetically by problem, with subentries allowing for distinct solutions and special cases to be listed by the year. An entry will include:
- a description of the basic algorithmic problem
- the input and output specifications
- the key results
- examples of applications
- citations to the key literature
This defining reference will be published in print and on line. The print publication will include an index of subjects and authors as well as a chronology for locating recent solutions. The online edition will supplement this index with hyperlinks as well as include hyperlinks in the text of the entries to related entries, xRefer citations, and other useful URLs mentioned above.
Cuprins
VLSI.-
Distributed
Computing.-
Parallel
Processing.-
Automated
Design.-
Robotics.-
Graphics.-
Data
Base
Design.-
Software
Tools.-
Sorting.-
Searching.-
Data
Structures.-
Computational
Geometry.-
Linear
Programming.
Recenzii
From
the
reviews:
"This book was designed to provide a comprehensive overview of developments in solving important algorithmic problems. … This encyclopedia provides an efficient reference for the definitions and key results of algorithmic problems. … The entries are in alphabetical order. There are over 300 entries and over 4,000 additional references. … In conclusion, the book is a valuable resource for theoretical computer scientists and people working in operations research and optimization." (Haris Aziz, ACM Computing Reviews, April, 2009)
“This is an encyclopedia of algorithms that sets out the solutions to important algorithmic problems. It aims to be a comprehensive collection and is designed to provide quick and easy access for both students and researchers.” (Kybernetes, Vol. 38 (1/2), 2009)
"This book was designed to provide a comprehensive overview of developments in solving important algorithmic problems. … This encyclopedia provides an efficient reference for the definitions and key results of algorithmic problems. … The entries are in alphabetical order. There are over 300 entries and over 4,000 additional references. … In conclusion, the book is a valuable resource for theoretical computer scientists and people working in operations research and optimization." (Haris Aziz, ACM Computing Reviews, April, 2009)
“This is an encyclopedia of algorithms that sets out the solutions to important algorithmic problems. It aims to be a comprehensive collection and is designed to provide quick and easy access for both students and researchers.” (Kybernetes, Vol. 38 (1/2), 2009)
Textul de pe ultima copertă
TheEncyclopedia
of
Algorithmsprovides
a
comprehensive
set
of
solutions
to
important
algorithmic
problems
for
students
and
researchers,
including
high-impact
solutions
from
the
most
recent
decade.
A must-have for computer scientists, this encyclopedic reference has been edited by Ming Yang Kao, Editor-in-Chief of the top journal in the field,Algorithmica.
All of the entries have been written and peer-reviewed by experts in the field. Nearly 400 entries are organized alphabetically by problem, with subentries for distinct solutions.
Extensive cross-references support efficient, user-friendly searches for immediate access to useful information.
This defining reference is published both in print and online. The print publication includes an index of subjects and authors as well as a chronology for locating recent solutions. The online edition supplements this index with hyperlinks as well as including internal hyperlinks to related entries in the text, CrossRef citations, and links to additional significant research.
Open problems, links to downloadable code, experimental results, data sets, and illustrations are included.
A must-have for computer scientists, this encyclopedic reference has been edited by Ming Yang Kao, Editor-in-Chief of the top journal in the field,Algorithmica.
All of the entries have been written and peer-reviewed by experts in the field. Nearly 400 entries are organized alphabetically by problem, with subentries for distinct solutions.
Extensive cross-references support efficient, user-friendly searches for immediate access to useful information.
This defining reference is published both in print and online. The print publication includes an index of subjects and authors as well as a chronology for locating recent solutions. The online edition supplements this index with hyperlinks as well as including internal hyperlinks to related entries in the text, CrossRef citations, and links to additional significant research.
Open problems, links to downloadable code, experimental results, data sets, and illustrations are included.
Caracteristici
No
comparable
reference
work
on
Algorithms
is
currently
available
A-Z organization allows easy, intuitive access to professionals and researchers interested in a particular aspect of Algorithms
Targeted literature references provide additional value for researchers looking to study a topic in more detail
Useful for scholars, researchers, and professionals who work in other fields — such as mathematics, statistics, biology, economics, financial software, medical informatics, and data mining
Editor-in-Chief is leader in field, with name recognition as EiC of top journal (Algorithmica)
Top-quality editorial board, both scientifically and geographically diverse – ensures balanced coverage
A-Z organization allows easy, intuitive access to professionals and researchers interested in a particular aspect of Algorithms
Targeted literature references provide additional value for researchers looking to study a topic in more detail
Useful for scholars, researchers, and professionals who work in other fields — such as mathematics, statistics, biology, economics, financial software, medical informatics, and data mining
Editor-in-Chief is leader in field, with name recognition as EiC of top journal (Algorithmica)
Top-quality editorial board, both scientifically and geographically diverse – ensures balanced coverage
Notă biografică
Ming-Yang Kao is Professor of Computer Science at the Northwestern University, Evanston. He got a B.S. in Mathematics, 1978 at the National Taiwan University, Republic of China (Taiwan) and his Ph.D. in Computer Science, 1986, at Yale University, USA.
Prof. Kao studies the design, analysis and implementation of algorithms. His work spans a broad range of applications including bioinformatics, computational finance, electronic commerce, and nanotechnology. Kao's most recent research includes work on DNA self-assembly, variants of the traveling salesman problem, and graph labeling problems.
Kao heads the EECS Computing, Algorithms & Applications Division and is the editor-in-chief of Algorithmica.
Prof. Kao studies the design, analysis and implementation of algorithms. His work spans a broad range of applications including bioinformatics, computational finance, electronic commerce, and nanotechnology. Kao's most recent research includes work on DNA self-assembly, variants of the traveling salesman problem, and graph labeling problems.
Kao heads the EECS Computing, Algorithms & Applications Division and is the editor-in-chief of Algorithmica.