Sciweavers

613 search results - page 103 / 123
» The Memory Fragmentation Problem: Solved
Sort
View
HPDC
2010
IEEE
15 years 3 months ago
ParaText: scalable text modeling and analysis
Automated analysis of unstructured text documents (e.g., web pages, newswire articles, research publications, business reports) is a key capability for solving important problems ...
Daniel M. Dunlavy, Timothy M. Shead, Eric T. Stant...
119
Voted
MCS
2007
Springer
15 years 2 months ago
A domain decomposition solver for ferromagnetism
We model ferromagnetic effects by using reduced scalar potential. An overlapping domain-decomposition technique is proposed to solve the underlying problem in unbounded domain. I...
Ales Janka
133
Voted
PAAPP
2002
76views more  PAAPP 2002»
15 years 2 months ago
Performance of PDE solvers on a self-optimizing NUMA architecture
Abstract. The performance of shared-memory (OpenMP) implementations of three different PDE solver kernels representing finite difference methods, finite volume methods, and spectra...
Sverker Holmgren, Markus Nordén, Jarmo Rant...
SAS
2010
Springer
143views Formal Methods» more  SAS 2010»
15 years 29 days ago
Points-to Analysis as a System of Linear Equations
The efficiency of a points-to analysis is critical for several compiler optimizations and transformations, and has attracted considerable research attention. Despite several advanc...
Rupesh Nasre, Ramaswamy Govindarajan
CG
2010
Springer
15 years 18 days ago
Scalability and Parallelization of Monte-Carlo Tree Search
Monte-Carlo Tree Search is now a well established algorithm, in games and beyond. We analyze its scalability, and in particular its limitations, and the implications in terms of pa...
Amine Bourki, Guillaume Chaslot, Matthieu Coulm, V...