2774 search results - page 334 / 555 » Exploiting Deep Structure |
177
click to vote
ESOP
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
172
click to vote
IUI
1998
ACM
15 years 10 months ago
1998
ACM
Interactive3Dlearningenvironmentscanproviderichproblemsolving experiences with unparalleled visual impact. In these environments, students interactively solve problems by directin...
148
click to vote
SPAA
1998
ACM
15 years 10 months ago
1998
ACM
Sparse LU factorization with partial pivoting is important for many scienti c applications and delivering high performance for this problem is di cult on distributed memory machin...
155
click to vote
MICRO
1997
IEEE
15 years 10 months ago
1997
IEEE
Highly aggressive multi-issue processor designs of the past few years and projections for the next decade require that we redesign the operation of the cache memory system. The nu...
221
click to vote
POPL
1993
ACM
15 years 10 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...