Sciweavers

16430 search results - page 2739 / 3286
» On Computable Tree Functions
Sort
View
MP
2008
99views more  MP 2008»
15 years 7 months ago
Efficient robust optimization for robust control with constraints
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
Paul J. Goulart, Eric C. Kerrigan, Daniel Ralph
SIAMSC
2008
131views more  SIAMSC 2008»
15 years 7 months ago
Gramian-Based Model Reduction for Data-Sparse Systems
Model order reduction (MOR) is common in simulation, control and optimization of complex dynamical systems arising in modeling of physical processes and in the spatial discretizati...
Ulrike Baur, Peter Benner
BMCBI
2004
156views more  BMCBI 2004»
15 years 7 months ago
DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors
Background: Parallel computing is frequently used to speed up computationally expensive tasks in Bioinformatics. Results: Herein, a parallel version of the multi-alignment program...
Martin Schmollinger, Kay Nieselt, Michael Kaufmann...
CORR
2002
Springer
102views Education» more  CORR 2002»
15 years 7 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson
JCNS
2000
165views more  JCNS 2000»
15 years 7 months ago
A Population Density Approach That Facilitates Large-Scale Modeling of Neural Networks: Analysis and an Application to Orientati
We explore a computationally efficient method of simulating realistic networks of neurons introduced by Knight, Manin, and Sirovich (1996) in which integrate-and-fire neurons are ...
Duane Q. Nykamp, Daniel Tranchina
« Prev « First page 2739 / 3286 Last » Next »