2474 search results - page 161 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
159
click to vote
SIAMJO
2008
15 years 5 months ago
2008
We propose a new iterative approach for solving linear programs over convex cones. Assuming that Slaters condition is satisfied, the conic problem is transformed to the minimizatio...
137
click to vote
REX
1991
15 years 8 months ago
1991
Abstract. We consider an optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this...
134
Voted
WSCG
2003
15 years 6 months ago
2003
In this paper we describe a basis for a system that is able to compute actual scientific and realistic visualization methods in parallel. It is capable to integrate easily in mod...
162
Voted
EGH
2009
Springer
15 years 2 months ago
2009
Springer
We present a strategy for performing view-adaptive, crack-free tessellation of Catmull-Clark subdivision surfaces entirely on programmable graphics hardware. Our scheme extends th...
146
Voted
DAC
1999
ACM
15 years 9 months ago
1999
ACM
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...