1146 search results - page 109 / 230 » Finite cupping sets |
AUTOMATICA
2005
13 years 10 months ago
2005
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...
TSMC
2008
13 years 10 months ago
2008
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is tha...
FUIN
2000
13 years 10 months ago
2000
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
For a stationary stochastic process {Xn} with values in some set A, a finite word w AK is called a memory word if the conditional probability of X0 given the past is constant on t...
MMAS
2010
Springer
13 years 5 months ago
2010
Springer
Based on the thermodynamic concept of a reservoir, we investigate a computational model for interaction with unresolved degrees of freedom (a thermal bath). We assume that a finite...