Sciweavers

130 search results - page 18 / 26
» Solving Dense Linear Systems on Graphics Processors
Sort
View
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
15 years 6 days ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
121
Voted
DM
2006
128views more  DM 2006»
15 years 17 days ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
97
Voted
SIGGRAPH
1998
ACM
15 years 4 months ago
Large Steps in Cloth Simulation
The bottle-neck in most cloth simulation systems is that time steps must be small to avoid numerical instability. This paper describes a cloth simulation system that can stably ta...
David Baraff, Andrew P. Witkin
110
Voted
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
15 years 6 months ago
A NSGA-II, web-enabled, parallel optimization framework for NLP and MINLP
Engineering design increasingly uses computer simulation models coupled with optimization algorithms to find the best design that meets the customer constraints within a time con...
David J. Powell, Joel K. Hollingsworth
94
Voted
SC
1994
ACM
15 years 4 months ago
A parallel formulation of interior point algorithms
In recent years, interior point algorithms have been used successfully for solving mediumto large-size linear programming LP problems. In this paper we describe a highly parallel ...
George Karypis, Anshul Gupta, Vipin Kumar