Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer algorithms --- Parallel computers --- Computer algorithms. --- Parallel computers. --- Electronic digital computers --- Algorithms --- Algorithms. --- Parallel Computation.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer science --- Computational complexity --- #KVIV:BB --- 681.3*F11 --- 681.3*F12 --- 681.3*F13 --- Complexity, Computational --- Electronic data processing --- Machine theory --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Modes of computation: alternation and nondeterminism; parallelism; probabilistic computation; relations among modes; relativized computation --- Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- 681.3*F13 Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- 681.3*F12 Modes of computation: alternation and nondeterminism; parallelism; probabilistic computation; relations among modes; relativized computation --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Logic, Symbolic and mathematical --- Logique mathématique --- Proof theory --- Théorie de la démonstration --- Complexité de calcul (informatique) --- Logique mathématique. --- Théorie de la démonstration. --- Logic, Symbolic and mathematical. --- Proof theory. --- Théorie de la démonstration --- Computational complexity. --- Informatique theorique --- Algorithmique --- Complexite

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

"The papers in this volume were presented at the Third Workshop on Algorithmsand Data Structures (WADS '93), held in Montreal, Canada, August 1993. The volume opens with five invited presentations: "Computing the all-pairs longest chains in the plane" by M.J. Atallah and D.Z. Chen, "Towards a better understanding of pure packet routing" by A. Borodin, "Tolerating faults in meshes and other networks" (abstract) by R. Cole, "A generalization of binary search" by R.M. Karp, and "Groups and algebraic complexity" (abstract) by A.C. Yao. The volume continues with 52 regular presentations selected from 165 submissions, each of which was evaluated by at least three program committee members, many of whom called upon additional reviewers."--PUBLISHER'S WEBSITE.

Algorithms --- Congresses --- Database design --- Data structures (Computer science) --- Computer algorithms --- Conferences - Meetings --- Information theory. --- Computer science. --- Global analysis (Mathematics). --- Computer software. --- Combinatorics. --- Theory of Computation. --- Programming Techniques. --- Analysis. --- Algorithm Analysis and Problem Complexity. --- Computation by Abstract Devices. --- Combinatorics --- Algebra --- Mathematical analysis --- Software, Computer --- Computer systems --- Analysis, Global (Mathematics) --- Differential topology --- Functions of complex variables --- Geometry, Algebraic --- Informatics --- Science --- Communication theory --- Communication --- Cybernetics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

"Most neural network programs for personal computers simply control a set of fixed, canned network-layer algorithms with pulldown menus. This new tutorial offers hands-on neural network experiments with a different approach. A simple matrix language lets users create their own neural networks and combine networks, and this is the only currently available software permitting combined simulation of neural networks together with other dynamic systems such as robots or physiological models. The enclosed student version of DESIRE/NEUNET differs from the full system only in the size of its data area and includes a screen editor, compiler, color graphics, help screens, and ready-to-run examples. Users can also add their own help screens and interactive menus. The book provides an introduction to neural networks and simulation, a tutorial on the software, and many complete programs including several backpropagation schemes, creeping random search, competitive learning with and without adaptive-resonance function and "conscience," counterpropagation, nonlinear Grossberg-type neurons, Hopfield-type and bidirectional associative memories, predictors, function learning, biological clocks, system identification, and more. In addition, the book introduces a simple, integrated environment for programming, displays, and report preparation. Even differential equations are entered in ordinary mathematical notation. Users need not learn C or LISP to program nonlinear neuron models. To permit truly interactive experiments, the extra-fast compilation is unnoticeable, and simulations execute faster than PC FORTRAN. The nearly 90 illustrations include block diagrams, computer programs, and simulation-output graphs."

Neural networks (Computer science) --- Expert systems (Computer science) --- 681.3*F11 --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Artificial neural networks --- Nets, Neural (Computer science) --- Networks, Neural (Computer science) --- Neural nets (Computer science) --- Artificial intelligence --- Natural computation --- Soft computing --- Knowledge-based systems (Computer science) --- Systems, Expert (Computer science) --- Computer systems --- Informatique --- Computer science --- Intelligence artificielle --- Systeme expert --- Expert systems. --- COMPUTER SCIENCE/Machine Learning & Neural Networks

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This volume contains the proceedings of the tenth annual Symposium on Theoretical Aspects of Computer Science (STACS '93), held in W}rzburg, February 25-27, 1993. The STACS symposia are held alternately in Germany and France, and organized jointly by the Special Interest Group for Theoretical Computer Science of the Gesellschaft f}r Informatik (GI) and theSpecial Interest Group for Applied Mathematics of the Association Francaise des Sciences et Technologies de l'Information et des Syst mes (afcet). The volume includes the three invited talks which opened the three days of the symposium: "Causal and distributed semantics for concurrent processes" (I. Castellani), "Parallel architectures: design and efficient use" (B. Monien et al.), and "Transparent proofs" (L. Babai). The selection of contributed papers is organized into parts on: computational complexity, logic in computer science, efficient algorithms, parallel and distributed computation, language theory, computational geometry, automata theory, semantics and logic of programming languages, automata theory and logic, circuit complexity, omega-automata, non-classical complexity, learning theory and cryptography, and systems.

Computer science --- Informatique --- Congresses --- Congrès --- Congrès --- Computer science - Congresses. --- Information theory. --- Computer science. --- Computer software. --- Logic design. --- Theory of Computation. --- Computation by Abstract Devices. --- Algorithm Analysis and Problem Complexity. --- Logics and Meanings of Programs. --- Mathematical Logic and Formal Languages. --- Arithmetic and Logic Structures. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Software, Computer --- Computer systems --- Informatics --- Science --- Communication theory --- Communication --- Cybernetics