Sciweavers

2303 search results - page 354 / 461
» On the logic of argumentation theory
Sort
View
MCU
2004
126views Hardware» more  MCU 2004»
15 years 7 months ago
Universality and Cellular Automata
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
Klaus Sutner
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
15 years 7 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
SCAI
1993
15 years 7 months ago
A Case-Based Answer to Some Problems of Knowledge-Based Systems
Among the most important challenges for contemporary AI research are the development of methods for improved robustness, adaptability, and overall interactiveness of systems. Inter...
Agnar Aamodt
NIPS
1996
15 years 7 months ago
A Model of Recurrent Interactions in Primary Visual Cortex
A general feature of the cerebral cortex is its massive interconnectivity-ithas been estimatedanatomically 15 that cortical neurons receive on the order of 10,000 synapses, the ma...
Emanuel Todorov, Athanassios Siapas, David Somers
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
15 years 7 months ago
Threshold selecting: best possible probability distribution for crossover selection in genetic algorithms
The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to find a solution of high fitness of a given combinatoria...
Jörg Lässig, Karl Heinz Hoffmann, Mihael...