الصفحة 1
الصفحة 1
New Computational Paradigms : Changing Conceptions of What is Computable
This book examines new developments in the theory and practice of computation from a mathematical perspective, with topics ranging from classical computability to complexity, from biocomputing to quantum computing. The book opens with an introduction by Andrew Hodges, the Turing biographer, who analyzes the pioneering work that anticipated recent developments concerning computation’s allegedly new paradigms. The remaining material covers traditional topics in computability theory such as relative computability, theory of numberings, and domain theory, in addition to topics on the relationships between proof theory, computability, and complexity theory.
Neural Network Theory
Neural Networks Theory is a major contribution to the neural networks literature. It is a treasure trove that should be mined by the thousands of researchers and practitioners worldwide who have not previously had access to the fruits of Soviet and Russian neural network research. Dr. Galushkin is to be congratulated and thanked for his completion of this monumental work; a book that only he could write. It is a major gift to the world.
Multicriteria Scheduling : Theory, Models and Algorithms
Scheduling and multicriteria optimisation theory have been subject, separately, to numerous studies. Since the last twenty years, multicriteria scheduling problems have been subject to a growing interest. However, a gap between multicriteria scheduling approaches and multicriteria optimisation field exits. This book is an attempt to collect the elementary of multicriteria optimisation theory and the basic models and algorithms of multicriteria scheduling. It is composed of numerous illustrations, algorithms and examples which may help the reader in understanding the presented concepts. This book covers general concepts such as Pareto optimality, complexity theory, and general method for multicriteria optimisation, as well as dedicated scheduling problems and algorithms: just-in-time scheduling, flexibility and robustness, single machine problems, parallel machine problems, shop problems, etc.
Modern cryptography ; Vol.1 : A classical introduction to informational and mathematical principle
This book systematically explores the statistical characteristics of cryptographic systems, the computational complexity theory of cryptographic algorithms and the mathematical principles behind various encryption and decryption algorithms. The theory stems from technology. Based on Shannon's information theory, this book systematically introduces the information theory, statistical characteristics and computational complexity theory of public key cryptography, focusing on the three main algorithms of public key cryptography, RSA, discrete logarithm and elliptic curve cryptosystem.
Membrane Computing; 8th International Workshop, WMC 2007 Thessaloniki, Greece, June 25-28, 2007 Revised Selected and Invited Papers
This volume contains a selection of papers presented at the Eighth Workshop on Membrane Computing, WMC8, which took place in Thessaloniki, Greece, during June 25–28, 2008. Special attention was paid to the interaction of membrane computing with biology and computer science, focusing on the - ological roots of membrane computing, on applications of membrane computing in biology and medicine, and on possible electronically based implementations.
Membrane Computing ; Vol. 3850 ; 6th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited Papers
The papers in this volume cover all the main directions of research in membrane computing, ranging from theoretical topics in mathematics and computer science, to application issues, especially in biology. More specifically, these papers present research on topics such as: computational power and complexity classes, new types of P systems, relationships to Petri nets, quantum computing, and brane calculi, determinism vs. nondeterminism, hierarchies, the size of small families, algebraic approaches, and designing polynomial solutions to NP-complete problems through the use of membrane systems. Like the previous workshops,
Information Theory and Network Coding
Information Theory and Network Coding consists of two parts: Components of Information Theory, and Fundamentals of Network Coding Theory. This work can be used as a reference for professional engineers in the area of communications.
Implementation and Applications of Automata ; 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings
This book constitutes the thoroughly refereed post-proceedings of the 13th International Conference on Implementation and Application of Automata, CIAA 2008, held in San Francisco, USA, in July 2008.The 26 revised full papers togehter with 4 invited papers were carefully reviewed and selected from 40 submissions and have gone through two rounds of reviewing and improvement. The papers cover various topics in the theory, implementation, and applications of automata and related structures.
Implementation and Application of Automata ; Vol. 4094 ; 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings
This book constitutes the refereed proceedings of the 11th International Conference on Implementation and Application of Automata, CIAA 2006, held in Taipei, Taiwan, in August 2006.
Implementation and Application of Automata ; Vol. 3845 ; 10th International Conference, CIAA 2005, Sophia Antipolis, France, June 27-29, 2005, Revised Selected Papers
Contains the notes of the two invited lectures, the 26 papers selected for presentation at the conference, and the abstracts of the eight posters that were displayed.
Implementation and application of automata ; Vol. 3317 ; 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers
Contains the revised versions of the papers presented at the 9th International Conference on Implemen- tion and Application of Automata, CIAA 2004. Also included are the extended abstracts of the posters accepted to the conference. The conference was held at Queen’s University in Kingston, Ontario, Canada on July 22–24, 2004. As for its predecessors, the theme of CIAA 2004 was the implementation of automata and grammars of all types and their application in other fields. The topics of the papers presented at the conference range from applications of automata in natural language and speech processing to protein sequencing and genecompression, and from state complexity and new algorithms for automata operations to applications of quantum finite automata.
Implementation and application of automata ; 12th International Conference, CIAA 2007, Prague, Czech Republic, July 16-18, 2007, Revised Selected Papers
The 12th International Conference on Implementation and Application of - tomata CIAA 2007 washeld at the Czech Technical Universityin Prague,Czech Republic on July 16–18, 2007. These proceedings contain the papers that were presented at CIAA 2007, as well as the abstracts of the poster papers that were displayed during the conference.
Group-based Cryptography
This book is about relations between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It is explored how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in public key cryptography. It is also shown that there is a remarkable feedback from cryptography to combinatorial group theory because some of the problems motivated by cryptography appear to be new to group theory, and they open many interesting research avenues within group theory.
Graph-theoretic concepts in computer science ; Vol. 3787 ; 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers
that aims to unite theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in Computer Science. This book provides results for various classes of graphs, graph computations, graph algorithms, and graph-theoretical applications in various fields.
Graphs, networks and algorithms ; 2nd ed.
This book have a chapter on the network simplex algorithm and a section on the five color theorem; this also necessitated some changes in the previous order of the presentation (so that the numbering differs from that of the first edition,beginning with Chapter 8). In addition to this, numerous smaller changes and corrections have been made and several recent developments have been discussed and referenced. There are also several new exercises.
Grammatical Picture Generation : A Tree-Based Approach
The book presents important types of picture generators, using a tree-based approach to stress their common algorithmic basis, the treatment influenced by the theory of computation, and the theory of formal languages in particular. It guides the reader through the basics of the tree-based approach on to dedicated chapters on line-drawing languages, collage grammars, iterated function systems, grid picture languages, languages of fractals, and languages of coloured collages, while presenting results about (un)decidable, NP-complete, or efficiently solvable problems, normal forms, hierarchies of language classes, and related phenomena.
FSTTCS 2007 : Foundations of software technology and theoretical computer science; 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings
This book constitutes the refereed proceedings of the 27th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2007. The papers provide original research results in fundamental aspects of computer science as well as reports from the frontline of software technology and theoretical computer science.
FSTTCS 2006 : Foundations of software technology and theoretical computer science ; 26th International Conference, Kolkata, India, December 13-15, 2006, Proceed
This book constitutes the refereed proceedings of the 26th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2006, held in Kolkata, India, in December 2006. It contains 38 papers that cover a broad variety of current topics from the theory of computing, ranging from formal methods, discrete mathematics, complexity theory, and automata theory to theoretical computer science in general.
FSTTCS 2005 : Foundations of software technology and theoretical computer science ; 25th International conference, Hyderabad, India, December 15-18, 2005, Proceedings
This year marks a milestone in the history of FST&TCS, which ?rst took place in 1981. We would like to take this opportunity to express our appreciation of the foresight and commitment to excellence shown by the early organizersof the conference. The conference is now organized by IARCS (Indian Association for Researchin Computing Science), and the conference has been the foundation on which the IARCS community has been built. To commemorate the Silver Jubilee of FST&TCS.
FSTTCS 2004 : Foundations of software technology and theoretical computer science ; 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings
The international conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS) is the longest-running conference on computer science in India, and is organized under the aegis of the Indian As- ciation for Research in Computing Science, IARCS. Since its inception in 1981, the conference (held annually in the month of December) has helped in nurt- ing and creating an environment for the exchange of ideas amongst the research community in the country, by attracting top scientists around the world to the conference. This volume contains the proceedings of the 24th FSTTCS conf- ence held in December 2004. A strong point of the FSTTCS programmes has been excellent invited talks by eminent computer scientists of international renown.
