Sciweavers

696 search results - page 45 / 140
» Explaining abstract counterexamples
Sort
View
113
Voted
SIGCSE
1994
ACM
135views Education» more  SIGCSE 1994»
15 years 7 months ago
Understanding the bottom-up SLR parser
This paper describes an application of one of the t abstract concepts taught in a compiler construction course. It demonstrates how the techniques behind the bottom-up SLR parser ...
Sami Khuri, Jason Williams
ICANN
2007
Springer
15 years 7 months ago
The Link Between Temporal Attention and Emotion: A Playground for Psychology, Neuroscience, and Plausible Artificial Neural Netw
Abstract. In this paper, we will address the endeavors of three disciplines, Psychology, Neuroscience, and Artificial Neural Network (ANN) modeling, in explaining how the mind perc...
Etienne B. Roesch, David Sander, Klaus R. Scherer
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
15 years 7 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz
EVOW
2006
Springer
15 years 7 months ago
The Honeybee Search Algorithm for Three-Dimensional Reconstruction
Abstract. This paper investigates the communication system of honeybees with the purpose of obtaining an intelligent approach for threedimensional reconstruction. A new framework i...
Gustavo Olague, Cesar Puente
BIRTHDAY
2008
Springer
15 years 5 months ago
Church's Problem and a Tour through Automata Theory
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
Wolfgang Thomas