Publications

Export 7148 results:
[ Author(Asc)] Title Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
S
Stoyle G, Hicks MW, Bierman G, Sewell P, Neamtiu I.  2005.  Mutatis mutandis: safe and predictable dynamic software updating. Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages. :183-194.
Stonedahl F, Rand W, Wilensky U.  2008.  CrossNet: a framework for crossover with network-based chromosomal representations. Proceedings of the 10th annual conference on Genetic and evolutionary computation. :1057-1064.
Stonedahl F, Rand W, Wilensky U.  2008.  Multi-agent learning with a distributed genetic algorithm. AAMAS 2008: ALAMAS + ALAg Workshop.
Stonedahl F, Rand W.  2012.  When Does Simulated Data Match Real Data? Comparing Model Calibration Functions using Genetic Algorithms World Congress on Social Simulation (WCSS), Taipei, Taiwan.
Stonedahl F, Anderson D, Rand W.  2011.  When does simulated data match real data? Proceedings of the 13th annual conference companion on Genetic and evolutionary computation. :231-232.
Stonedahl F, Rand W, Wilensky U.  2010.  Evolving viral marketing strategies. Proceedings of the 12th annual conference on Genetic and evolutionary computation. :1195-1202.
Stine CO, Alam M, Tang L, Nair BG, Siddique KA, Faruque SM, Huq A, Colwell RR, Sack BR, Morris GJ.  2008.  Seasonal Cholera from Multiple Small Outbreaks, Rural Bangladesh. Emerging Infectious DiseasesEmerg Infect Dis. 14(5):831-833.
Stewart G.W.  2003.  On the powers of a matrix with perturbations. Numerische Mathematik. 96(2):363-376.
Stewart G.W.  1998.  Basic decompositions. 1
Stewart G.W.  1995.  Gauss, Statistics, and Gaussian Elimination. Journal of Computational and Graphical Statistics. 4(1):1-11.
Stewart G.W.  1998.  Two Algorithms for the The Efficient Computation of Truncated Pivoted QR Approximations to a Sparse Matrix. UMIACS-TR-98-12
Stewart G.W.  2007.  A Residual Inverse Power Method. UMIACS-TR-2007-09
Stewart G.W.  1998.  On an Inexpensive Triangular Approximation to the Singular Value Decomposition. UMIACS-TR-97-75
Stewart G.W.  2004.  An Elsner-like perturbation theorem for generalized eigenvalues. Linear Algebra and its Applications. 390:1-5.
Stewart G.W.  2001.  On the eigensystems of graded matrices. Numerische Mathematik. 90(2):349-370.
Stewart G.W.  1997.  On the weighting method for least squares problems with linear equality constraints. BIT Numerical Mathematics. 37(4):961-967.
Stewart G.W.  1999.  The QLP Approximation to the Singular Value Decomposition. SIAM Journal on Scientific Computing. 20(4):1336-1348.
Stewart G.W.  1997.  On markov chains with sluggish transients. Communications in Statistics. Stochastic Models. 13(1):85-94.
Stewart G.W.  1995.  On the perturbation of Schur complement in positive semidefinite matrix. TR-95-38
Stewart G.W.  2001.  Backward Error Bounds for Approximate Krylov Subspaces. UMIACS-TR-2001-32
Stewart J, Raybourn E, Bederson BB, Druin A.  1998.  When Two Hands Are Better Than One: Enhancing Collaboration Using Single Display Groupware. CHI’98. Extended Abstracts. :287-288.
Stewart G.W.  1999.  Four algorithms for the efficient computation of truncated pivoted QR approximations to a sparse matrix. Numerische Mathematik. 83(2):313-323.
Stewart J, Bederson BB, Druin A.  1999.  Single display groupware: a model for co-present collaboration. Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit. :286-293.
Stewart G.W.  2006.  A note on generalized and hypergeneralized projectors. Linear Algebra and its Applications. 412(2–3):408-411.
Stewart G.W.  2003.  Memory leaks in derived types revisited. SIGPLAN Fortran Forum. 22(3):25-27.

Pages