Sciweavers

3082 search results - page 274 / 617
» New Bounds for the Controller Problem
Sort
View
163
Voted
FSTTCS
2003
Springer
15 years 12 months ago
Pushdown Games with Unboundedness and Regular Conditions
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning condition...
Alexis-Julien Bouquet, Olivier Serre, Igor Walukie...
ESANN
2008
15 years 8 months ago
Self-Organizing Maps for cyclic and unbounded graphs
Abstract. This paper introduces a new concept to the processing of graph structured information using self organising map framework. Previous approaches to this problem were limite...
Markus Hagenbuchner, Alessandro Sperduti, Ah Chung...
NIPS
2000
15 years 8 months ago
Foundations for a Circuit Complexity Theory of Sensory Processing
We introduce total wire length as salient complexity measure for an analysis of the circuit complexity of sensory processing in biological neural systems and neuromorphic engineer...
Robert A. Legenstein, Wolfgang Maass
AMC
2008
88views more  AMC 2008»
15 years 6 months ago
Stopping rules for box-constrained stochastic global optimization
We present three new stopping rules for Multistart based methods. The first uses a device that enables the determination of the coverage of the bounded search domain. The second i...
Isaac E. Lagaris, Ioannis G. Tsoulos
CORR
2008
Springer
94views Education» more  CORR 2008»
15 years 6 months ago
Robust Joint Source-Channel Coding for Delay-Limited Applications
In this paper, we consider the problem of robust joint source-channel coding over an additive white Gaussian noise channel. We propose a new scheme which achieves the optimal slope...
Mahmoud Taherzadeh, Amir K. Khandani