Sciweavers

749 search results - page 122 / 150
» Combinatory Models and Symbolic Computation
Sort
View
PLDI
2009
ACM
15 years 4 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
ACMACE
2008
ACM
14 years 12 months ago
BeatBender: subsumption architecture for autonomous rhythm generation
BeatBender is a computer music project that explores a new method for generating emergent rhythmic drum patterns using the subsumption architecture. Rather than explicitly coding ...
Aaron Levisohn, Philippe Pasquier
ATVA
2006
Springer
114views Hardware» more  ATVA 2006»
15 years 1 months ago
Selective Approaches for Solving Weak Games
Abstract. Model-checking alternating-time properties has recently attracted much interest in the verification of distributed protocols. While checking the validity of a specificati...
Malte Helmert, Robert Mattmüller, Sven Schewe
NIPS
2000
14 years 11 months ago
Processing of Time Series by Neural Circuits with Biologically Realistic Synaptic Dynamics
Experimental data show that biological synapses behave quite differently from the symbolic synapses in common artificial neural network models. Biological synapses are dynamic, i....
Thomas Natschläger, Wolfgang Maass, Eduardo D...
ICPR
2004
IEEE
15 years 11 months ago
A Strongly Coupled Architecture for Contextual Object and Scene Identification
The context-centered approach to object detection and recognition is based on the intuition that the contextual information of real-world scenes provides relevant information for ...
James J. Clark, Tina Ehtiati