Sciweavers

13784 search results - page 2195 / 2757
» On Computing Functions with Uncertainty
Sort
View
CORR
2007
Springer
95views Education» more  CORR 2007»
15 years 7 months ago
Scheduling in Data Intensive and Network Aware (DIANA) Grid Environments
In Grids scheduling decisions are often made on the basis of jobs being either data or computation intensive: in data intensive situations jobs may be pushed to the data and in co...
Richard McClatchey, Ashiq Anjum, Heinz Stockinger,...
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
« Prev « First page 2195 / 2757 Last » Next »