scientific article; zbMATH DE number 826255

Publication date: 14 December 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) General topics in artificial intelligence (68T01)

Related Items (62)

Towards Computational Models of Artificial Cognitive Systems That Can, in Principle, Pass the Turing Test ⋮ A stochastic population approach to the problem of stable recruitment hierarchies in spiking neural networks ⋮ A quantitative theory of neural computation ⋮ Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks ⋮ A neural network wave formalism ⋮ A graph-theoretic result for a model of neural computation ⋮ Learning hierarchically-structured concepts ⋮ Leveraging multiple channels in ad hoc networks ⋮ A basic compositional model for spiking neural networks ⋮ Bell inequality, nonlocality and analyticity ⋮ WEAK DISHARMONY: SOME LESSONS FOR PROOF-THEORETIC SEMANTICS ⋮ Algebraic methods in the congested clique ⋮ Nonmonotonic reasoning by inhibition nets ⋮ On the relevance of time in neural computation and learning ⋮ Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees ⋮ Unnamed Item ⋮ Near-Optimal Scheduling of Distributed Algorithms ⋮ Scheduling Loop-free Network Updates ⋮ New Routing Techniques and their Applications ⋮ Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata ⋮ Fast and Exact Majority in Population Protocols ⋮ Distributed House-Hunting in Ant Colonies ⋮ Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication ⋮ Near-Optimal Distributed Maximum Flow ⋮ Toward Optimal Bounds in the Congested Clique ⋮ Fast Distributed Almost Stable Matchings ⋮ A (Truly) Local Broadcast Layer for Unreliable Radio Networks ⋮ Efficient Communication in Cognitive Radio Networks ⋮ A Local Broadcast Layer for the SINR Network Model ⋮ Fast Partial Distance Estimation and Applications ⋮ Trading Fences with RMRs and Separating Memory Models ⋮ The Price of being Adaptive ⋮ On the Time and Space Complexity of ABA Prevention and Detection ⋮ Impossibility Results for Distributed Transactional Memory ⋮ Safety-Liveness Exclusion in Distributed Computing ⋮ Lock-Free Algorithms under Stochastic Schedulers ⋮ On the Space Complexity of Set Agreement ⋮ How Fair is Your Protocol? ⋮ Adaptively Secure Computation with Partial Erasures ⋮ Improved Analysis of Deterministic Load-Balancing Schemes ⋮ Randomized Proof-Labeling Schemes ⋮ Distributed Convex Thresholding ⋮ Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks ⋮ On Information Complexity in the Broadcast Model ⋮ How To Elect a Leader Faster than a Tournament ⋮ The Weakest Failure Detector for Eventual Consistency ⋮ Limitations of Highly-Available Eventually-Consistent Data Stores ⋮ Computing Weak Consistency in Polynomial Time ⋮ On the Push&Pull Protocol for Rumour Spreading ⋮ Distributed Resource Discovery in Sub-Logarithmic Time ⋮ The Cost of Synchronizing Multiple-Access Channels ⋮ Towards Optimal Synchronous Counting ⋮ Fault-Tolerant Consensus in Directed Graphs ⋮ Minimal Synchrony for Byzantine Consensus ⋮ Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems ⋮ Dual Failure Resilient BFS Structure ⋮ Robust logics ⋮ Learning to assign degrees of belief in relational domains ⋮ Random Graphs In A Neural Computation Model ⋮ Experience-Induced Neural Circuits That Achieve High Capacity ⋮ The computational limits to the cognitive power of the neuroidal tabula rasa ⋮ The Hippocampus as a Stable Memory Allocator for Cortex

This page was built for publication: