kao ming yang (30 resultados)

Condición: New.

Paperback or Softback. Condición: New. Algorithmic Aspects in Information and Management: Third International Conference, Aaim 2007, Portland, Or, Usa, June 6-8, 2007, Proceedings. Book.

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: As New. Unread book in perfect condition.

Condición: New. In.

PF. Condición: New.

Condición: New.

Condición: New.

Condición: New. pp. xii + 428 1st Edition.

Condición: New. pp. xii + 428 Illus.

Condición: As New. Unread book in perfect condition.

Condición: As New. Unread book in perfect condition.

Condición: New. pp. xii + 428.

Paperback. Condición: Brand New. 1998 edition. 372 pages. 9.25x6.25x0.75 inches. In Stock.

Paperback. Condición: Brand New. 1st edition. 428 pages. 9.00x6.00x1.00 inches. In Stock.

Condición: New.

Kartoniert / Broschiert. Condición: New. This book constitutes the refereed proceedings of the Third International Conference on Algorithmic Aspects in Information and Management, AAIM 2007, held in Portland, OR, USA in June 2007.It covers graph algorithms, combinatorics, scheduling, gra.

Taschenbuch. Condición: Neu. Algorithmic Aspects in Information and Management | Third International Conference, AAIM 2007, Portland, OR, USA, June 6-8, 2007, Proceedings | Kao Ming-Yang (u. a.) | Taschenbuch | xii | Englisch | 2007 | Springer | EAN 9783540728689 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the Third International Conference on Algorithmic Aspects in Information and Management, AAIM 2007, held in Portland, OR, USA in June 2007.It covers graph algorithms, combinatorics, scheduling, graph theory, network algorithms, game theory, option theory, computational geometry, graph theory and combinatorics, as well as networks and data.

Condición: new.

Hardcover. Condición: new. Hardcover. This dynamic reference work provides solutions to vital algorithmic problems for scholars, researchers, practitioners, teachers and students in fields such as computer science, mathematics, statistics, biology, economics, financial software, and medical informatics. This second edition is broadly expanded, building upon the success of its former edition with more than 450 new and updated entries. These entries are designed to ensure algorithms are presented from growing areas of research such as bioinformatics, combinatorial group testing, differential privacy, enumeration algorithms, game theory, massive data algorithms, modern learning theory, social networks, and VLSI CAD algorithms.Over 630 entries are organized alphabetically by problem, with subentries allowing for distinct solutions. Each entry includes a description of the basic algorithmic problem; the input and output specifications; key results; examples of applications; citations to key literature, open problems, experimental results, links to data sets and downloadable code.All entries are peer-reviewed, written by leading experts in the fieldand each entry contains links to a summary of the authors research work. This defining reference is available in both print and onlinea dynamic living work with hyperlinks to related entries, cross references citations, and a myriad other valuable URLs.New and Updated entries include:Algorithmic Aspects of Distributed Sensor Networks, Algorithms for Modern Computers Bioinformatics Certified Reconstruction and Mesh Generation Combinatorial Group Testing Compression of Text and Data Structures Computational Counting Computational Economics Computational Geometry Differential Privacy Enumeration Algorithms Exact Exponential Algorithms Game Theory Graph Drawing Group Testing Internet Algorithms Kernels and Compressions Massive Data Algorithms Mathematical Optimization Modern Learning Theory Social Networks Stable Marriage Problems, k-SAT Algorithms Sublinear Algorithms Tile Self-Assembly VLSI CAD Algorithms Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Hardcover. Condición: new. Hardcover. This dynamic reference work provides solutions to vital algorithmic problems for scholars, researchers, practitioners, teachers and students in fields such as computer science, mathematics, statistics, biology, economics, financial software, and medical informatics. This second edition is broadly expanded, building upon the success of its former edition with more than 450 new and updated entries. These entries are designed to ensure algorithms are presented from growing areas of research such as bioinformatics, combinatorial group testing, differential privacy, enumeration algorithms, game theory, massive data algorithms, modern learning theory, social networks, and VLSI CAD algorithms.Over 630 entries are organized alphabetically by problem, with subentries allowing for distinct solutions. Each entry includes a description of the basic algorithmic problem; the input and output specifications; key results; examples of applications; citations to key literature, open problems, experimental results, links to data sets and downloadable code.All entries are peer-reviewed, written by leading experts in the fieldand each entry contains links to a summary of the authors research work. This defining reference is available in both print and onlinea dynamic living work with hyperlinks to related entries, cross references citations, and a myriad other valuable URLs.New and Updated entries include:Algorithmic Aspects of Distributed Sensor Networks, Algorithms for Modern Computers Bioinformatics Certified Reconstruction and Mesh Generation Combinatorial Group Testing Compression of Text and Data Structures Computational Counting Computational Economics Computational Geometry Differential Privacy Enumeration Algorithms Exact Exponential Algorithms Game Theory Graph Drawing Group Testing Internet Algorithms Kernels and Compressions Massive Data Algorithms Mathematical Optimization Modern Learning Theory Social Networks Stable Marriage Problems, k-SAT Algorithms Sublinear Algorithms Tile Self-Assembly VLSI CAD Algorithms Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Buch. Condición: Neu. Neuware - The 2 nd ed. of this comprehensive work provides a set of solutions to important algorithmic problems for students and researchers interested in quickly locating useful information. The first edition of the reference focused on high-impact solutions from the most recent decade; this edition widens the scope of the work.Nearly 500 entries are organized alphabetically by problem, with subentries allowing for distinct solutions and special cases to be listed by the year. An entry includes: a description of the basic algorithmic problem; the input and output specifications; the key results; examples of applications; citations to the key literature.Open problems, links to downloadable code, experimental results, data sets, and illustrations are provided. All entries are written by experts with links to Internet sites that outline their research work. The entries are peer-reviewed.This defining reference is published in print and on line. 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 and also includes hyperlinks in the text of the entries to related entries, xRefer citations, and other useful URLs mentioned above.

Condición: New. Covers a wealth of problems currently relevant in diverse fields including biology, economics, financial software and computer science, amongst othersPresents accessible, updated and enhanced, A-Z entries with useful cross-referencesFeature.

Hardcover. Condición: Brand New. 2nd edition. 2389 pages. 10.25x8.00x6.00 inches. In Stock.

paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book constitutes the refereed proceedings of the Third International Conference on Algorithmic Aspects in Information and Management, AAIM 2007, held in Portland, OR, USA in June 2007.It covers graph algorithms, combinatorics, scheduling, graph theory, network algorithms, game theory, option theory, computational geometry, graph theory and combinatorics, as well as networks and data. 428 pp. Englisch.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The papers in this volume were selected for presentation at the Fourth Annual International Computing and Combinatorics Conference (COCOON'98), held on August 12-14, 1998, in Taipei. The topics cover most aspects of theoretical computer science and combinatorics related to computing. Submissions to the conference this year was only conducted electronically. Thanks to the excellent software developed by the system team of the Institute of Information Science, we were able to make virtually all communications through the World Wide Web. A total of 69 papers was submitted in time to be considered, of which 36 papers were accepted for presentation at the conference. In addition to these contributed papers, the conference also included four invited presentations by Christo Papadimitriou, Michael Fishcher, Fan Chung Graham and Rao Kosaraju. It is expected that most of the accepted papers will appear in a more complete form in scienti c journals. Moreover, selected papers will appear in a special issue of Theoretical Computer Science. We thank all program committee members, their support sta and referees for excellent work within demanding time constraints. We thank all authors who submitted papers for consideration. We are especially grateful to our colleagues who worked hard and o ered widely di ering talents to make the conference both possible and enjoyable. August 1998 Wen-Lian Hsu and Ming-Yang Kao Program Co-chairs COCOON'98 Organization COCOON'98 is organized by the Institute of Information Science, Academia Sinica, Taipei, Taiwan, ROC and in cooperation with Institute of Information and Computing Machinery (IICM), Taiwan, ROC. 404 pp. Englisch.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Covers a wealth of problems currently relevant in diverse fields including biology, economics, financial software and computer science, amongst othersPresents accessible, updated and enhanced, A-Z entries with useful cross-referencesFeature.