STACS 99

STACS 99

Author: Christoph Meinel

Publisher: Springer

Published: 2003-05-21

Total Pages: 597

ISBN-13: 3540491163

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, STACS 99, held in Trier, Germany in March 1999. The 51 revised full papers presented were selected from a total of 146 submissions. Also included are three invited papers. The volume is divided in topical sections on complexity, parallel algorithms, computational geometry, algorithms and data structures, automata and formal languages, verification, algorithmic learning, and logic in computer science.


SOFSEM'99: Theory and Practice of Informatics

SOFSEM'99: Theory and Practice of Informatics

Author: Jan Pavelka

Publisher: Springer Science & Business Media

Published: 1999-11-11

Total Pages: 510

ISBN-13: 354066694X

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics, SOFSEM'99, held in Milovy, Czech Republic, in November/December 1999. The volume presents 19 invited survey articles by leading researchers together with 18 revised full research papers selected from 45 submissions. The areas covered include trends in theory, core technologies, software and information engineering, from data to knowledge, and advanced applications.


Foundations and Tools for Neural Modeling

Foundations and Tools for Neural Modeling

Author: Jose Mira

Publisher: Springer Science & Business Media

Published: 1999-05-19

Total Pages: 900

ISBN-13: 9783540660699

DOWNLOAD EBOOK

This book constitutes, together with its compagnion LNCS 1606, the refereed proceedings of the International Work-Conference on Artificial & Neural Networks, IWANN'99, held in Alicante, Spain in June 1999. The 91 revised papers presented were carefully reviewed & selected for inclusion in the book. This volume is devoted to applications of biologically inspired artificial neural networks in various engineering disciplines. The papers are organized in parts on artificial neural nets simulation & implementation, image processing & engineering applications.


High Performance Computing

High Performance Computing

Author: Constantine Polychronopoulos

Publisher: Springer Science & Business Media

Published: 1999-05-12

Total Pages: 428

ISBN-13: 9783540659693

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the Second International Symposium on High-Performance Computing, ISHPC'99, held in Kyoto, Japan in May 1999. The 23 revised full papers presented were carefully selected from a total of 61 submissions. Also included are the abstracts of several invited talks and 12 reviewed short papers corresponding to the poster presentations given at the symposium. The papers address many current issues in high-performance computing and communication, regarding hardware and network architectures as well as regarding software and theoretical foundations; also advanced applications are studied in a variety of fields including modeling, visualisation, and computational science.


Foundations of Intelligent Systems

Foundations of Intelligent Systems

Author: Zbigniew W. Ras

Publisher: Springer Science & Business Media

Published: 1999-05-12

Total Pages: 700

ISBN-13: 9783540659655

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 11th International Symposium on Methodologies for Intelligent Systems, ISMIS '99, held in Warsaw, Poland, in June 1999. The 66 revised full papers presented together with five invited papers were carefully reviewed and selected from a total of 115 submissions. The volume is divided into topical sections on logics for AI, intelligent information retrieval, intelligent information systems, learning and knowledge discovery, computer vision, knowledge representation, and evolutionary computation.


Mathematical Foundations of Computer Science 2000

Mathematical Foundations of Computer Science 2000

Author: Mogens Nielsen

Publisher: Springer

Published: 2003-06-29

Total Pages: 724

ISBN-13: 3540446125

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science, MFCS 2000, held in Bratislava/Slovakia in August/September 2000. The 57 revised full papers presented together with eight invited papers were carefully reviewed and selected from a total of 147 submissions. The book gives an excellent overview on current research in theoretical informatics. All relevant foundational issues, from mathematical logics as well as from discrete mathematics are covered. Anybody interested in theoretical computer science or the theory of computing will benefit from this book.


Automated Technology for Verification and Analysis

Automated Technology for Verification and Analysis

Author: Doron A. Peled

Publisher: Springer Science & Business Media

Published: 2005-09-19

Total Pages: 516

ISBN-13: 3540292098

DOWNLOAD EBOOK

The Automated Technology for Veri?cation and Analysis (ATVA) international symposium series was initiated in 2003, responding to a growing interest in formal veri?cation spurred by the booming IT industry, particularly hardware design and manufacturing in East Asia. Its purpose is to promote research on automated veri?cation and analysis in the region by providing a forum for int- action between the regional and the international research/industrial commu- ties of the ?eld. ATVA 2005, the third of the ATVA series, was held in Taipei, Taiwan, October 4–7, 2005. The main theme of the symposium encompasses - sign, complexities, tools, and applications of automated methods for veri?cation and analysis. The symposium was co-located and had a two-day overlap with FORTE 2005, which was held October 2–5, 2005. We received a total of 95 submissions from 17 countries. Each submission was assigned to three Program Committee members, who were helped by their subreviewers, for rigorous and fair evaluation. The ?nal deliberation by the P- gram Committee was conducted over email for a duration of about 10 days after nearly all review reports had been collected. In the end, 33 papers were - lectedforinclusionintheprogram.ATVA2005hadthreekeynotespeechesgiven respectively by Amir Pnueli (joint with FORTE 2005), Zohar Manna, and Wo- gang Thomas. The main symposium was preceded by a tutorial day, consisting of three two-hour lectures given also by the keynote speakers.


Handbook of Approximation Algorithms and Metaheuristics

Handbook of Approximation Algorithms and Metaheuristics

Author: Teofilo F. Gonzalez

Publisher: CRC Press

Published: 2018-05-15

Total Pages: 840

ISBN-13: 1351236407

DOWNLOAD EBOOK

Handbook of Approximation Algorithms and Metaheuristics, Second Edition reflects the tremendous growth in the field, over the past two decades. Through contributions from leading experts, this handbook provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics. Volume 1 of this two-volume set deals primarily with methodologies and traditional applications. It includes restriction, relaxation, local ratio, approximation schemes, randomization, tabu search, evolutionary computation, local search, neural networks, and other metaheuristics. It also explores multi-objective optimization, reoptimization, sensitivity analysis, and stability. Traditional applications covered include: bin packing, multi-dimensional packing, Steiner trees, traveling salesperson, scheduling, and related problems. Volume 2 focuses on the contemporary and emerging applications of methodologies to problems in combinatorial optimization, computational geometry and graphs problems, as well as in large-scale and emerging application areas. It includes approximation algorithms and heuristics for clustering, networks (sensor and wireless), communication, bioinformatics search, streams, virtual communities, and more. About the Editor Teofilo F. Gonzalez is a professor emeritus of computer science at the University of California, Santa Barbara. He completed his Ph.D. in 1975 from the University of Minnesota. He taught at the University of Oklahoma, the Pennsylvania State University, and the University of Texas at Dallas, before joining the UCSB computer science faculty in 1984. He spent sabbatical leaves at the Monterrey Institute of Technology and Higher Education and Utrecht University. He is known for his highly cited pioneering research in the hardness of approximation; for his sublinear and best possible approximation algorithm for k-tMM clustering; for introducing the open-shop scheduling problem as well as algorithms for its solution that have found applications in numerous research areas; as well as for his research on problems in the areas of job scheduling, graph algorithms, computational geometry, message communication, wire routing, etc.


Secure Internet Programming

Secure Internet Programming

Author: Jan Vitek

Publisher: Springer

Published: 2007-10-23

Total Pages: 500

ISBN-13: 3540487492

DOWNLOAD EBOOK

Large-scale open distributed systems provide an infrastructure for assembling global applications on the basis of software and hardware components originating from multiple sources. Open systems rely on publicly available standards to permit heterogeneous components to interact. The Internet is the archetype of a large-scale open distributed system; standards such as HTTP, HTML, and XML, together with the widespread adoption of the Java language, are the cornerstones of many distributed systems. This book surveys security in large-scale open distributed systems by presenting several classic papers and a variety of carefully reviewed contributions giving the results of new research and development. Part I provides background requirements and deals with fundamental issues in trust, programming, and mobile computations in large-scale open distributed systems. Part II contains descriptions of general concepts, and Part III presents papers detailing implementations of security concepts.