15485 search results - page 2473 / 3097 » Computing Optimal Subsets |
182
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
A binary-tree algorithm, Bin(n), proceeds level-bylevel from the leaves of a 2n -leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on mul...
202
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
One of the major overheads that prohibits the wide spread deployment of parallel discrete event simulation PDES is the need to synchronize the distributed processes in the simulat...
182
click to vote
ERSHOV
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. An abstract framework is developed to describe program transformation by specializing a given program to a restricted set of inputs. Particular cases include partial eval...
197
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...
206
click to vote
ESOP
1999
Springer
15 years 11 months ago
1999
Springer
Safety of interoperation of program fragments written in different safe languages may fail when the languages have different systems of computational effects: an exception raised b...