Sciweavers

437 search results - page 47 / 88
» Adaptivity and computational complexity in the numerical sol...
Sort
View
SIAMSC
2010
132views more  SIAMSC 2010»
13 years 7 months ago
New Algorithms for Optimal Online Checkpointing
Frequently, the computation of derivatives for optimizing time-dependent problems is based on the integration of the adjoint differential equation. For this purpose, the knowledge...
Philipp Stumm, Andrea Walther
HOTOS
1997
IEEE
14 years 27 days ago
The Role of Trace Modulation in Building Mobile Computing Systems
ty of accurately re-creating a mobile networkingAbstract environment in vitro argues for live experiments. On the In this paper we put forth the view that trace other hand, the dif...
Mahadev Satyanarayanan, Brian Noble
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
14 years 2 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
MMAS
2010
Springer
13 years 3 months ago
A Novel Method for Solving Multiscale Elliptic Problems with Randomly Perturbed Data
We propose a method for efficient solution of elliptic problems with multiscale features and randomly perturbed coefficients. We use the multiscale finite element method (MsFEM) as...
Victor Ginting, Axel Målqvist, Michael Presh...
SAC
2010
ACM
14 years 1 months ago
Data stream anomaly detection through principal subspace tracking
We consider the problem of anomaly detection in multiple co-evolving data streams. In this paper, we introduce FRAHST (Fast Rank-Adaptive row-Householder Subspace Tracking). It au...
Pedro Henriques dos Santos Teixeira, Ruy Luiz Mili...