Sciweavers

21324 search results - page 398 / 4265
» Making the case for computing
Sort
View
SC
2003
ACM
15 years 10 months ago
Optimizing Reduction Computations In a Distributed Environment
We investigate runtime strategies for data-intensive applications that involve generalized reductions on large, distributed datasets. Our set of strategies includes replicated fi...
Tahsin M. Kurç, Feng Lee, Gagan Agrawal, &U...
ICLP
2003
Springer
15 years 10 months ago
Computing Minimal Models, Stable Models, and Answer Sets
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
Zbigniew Lonc, Miroslaw Truszczynski
155
Voted
ICCS
2001
Springer
15 years 9 months ago
Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
Eun-Jin Im, Katherine A. Yelick
APCSAC
2007
IEEE
15 years 9 months ago
Exploiting Task Temperature Profiling in Temperature-Aware Task Scheduling for Computational Clusters
Many years of CMOS technology scaling have resulted in increased power densities and higher core temperatures. Power and temperature concerns are now considered to be a primary cha...
Daniel C. Vanderster, Amirali Baniasadi, Nikitas J...
CAGD
2008
99views more  CAGD 2008»
15 years 5 months ago
Topology and arrangement computation of semi-algebraic planar curves
We describe a new subdivision method to efficiently compute the topology and the arrangement of implicit planar curves. We emphasize that the output topology and arrangement are g...
Lionel Alberti, Bernard Mourrain, Julien Wintz