Sciweavers

4894 search results - page 506 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
CDC
2009
IEEE
156views Control Systems» more  CDC 2009»
15 years 9 months ago
Input design using Markov chains for system identification
This paper studies the input design problem for system identification where time domain constraints have to be considered. A finite Markov chain is used to model the input of the s...
Chiara Brighenti, Bo Wahlberg, Cristian R. Rojas
SAT
2010
Springer
141views Hardware» more  SAT 2010»
15 years 8 months ago
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shor...
Carsten Fuhs, Peter Schneider-Kamp
GECCO
2007
Springer
144views Optimization» more  GECCO 2007»
15 years 8 months ago
Mixing independent classifiers
In this study we deal with the mixing problem, which concerns combining the prediction of independently trained local models to form a global prediction. We deal with it from the ...
Jan Drugowitsch, Alwyn Barry
130
Voted
EDBTW
2006
Springer
15 years 8 months ago
Constructing Optimal Wavelet Synopses
The wavelet decomposition is a proven tool for constructing concise synopses of massive data sets and rapid changing data streams, which can be used to obtain fast approximate, wit...
Dimitris Sacharidis
WSC
2008
15 years 7 months ago
On step sizes, stochastic shortest paths, and survival probabilities in Reinforcement Learning
Reinforcement Learning (RL) is a simulation-based technique useful in solving Markov decision processes if their transition probabilities are not easily obtainable or if the probl...
Abhijit Gosavi