Sciweavers

3670 search results - page 378 / 734
» Linear Recursive Functions
Sort
View
AAAI
1998
15 years 8 months ago
A Tractable Walsh Analysis of SAT and its Implications for Genetic Algorithms
Walsh Transforms measure all sources of nonlinear interactions for functions that have a bit representation. There can be exponentially many nonlinear interactions and exactly com...
Soraya B. Rana, Robert B. Heckendorn, L. Darrell W...
IPCO
1992
100views Optimization» more  IPCO 1992»
15 years 8 months ago
An Exact Characterization of Greedy Structures
We present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which we call matroid embeddings, complete the par...
Paul Helman, Bernard M. E. Moret, Henry D. Shapiro
AUTOMATICA
2007
142views more  AUTOMATICA 2007»
15 years 6 months ago
Supervisory control using a new control-relevant switching
This paper presents a new supervisory control scheme, which is based on a control-relevant switching logic. Unlike most of the existing switching methods considering only estimato...
Tae-Woong Yoon, Jung-Su Kim, A. Stephen Morse
CORR
2010
Springer
97views Education» more  CORR 2010»
15 years 6 months ago
Analysis of a Splitting Estimator for Rare Event Probabilities in Jackson Networks
We consider a standard splitting algorithm for the rare-event simulation of overflow probabilities in any subset of stations in a Jackson network at level n, starting at a fixed i...
Jose Blanchet, Kevin Leder, Yixi Shi
CORR
2010
Springer
253views Education» more  CORR 2010»
15 years 6 months ago
Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
Koray Kavukcuoglu, Marc'Aurelio Ranzato, Yann LeCu...