1710 search results - page 140 / 342 » High-Level Programs and Program Conditions |
PLDI
1998
ACM
14 years 14 days ago
1998
ACM
The conditional branch has long been considered an expensive operation. The relative cost of conditional branches has increased as recently designed machines are now relying on de...
SEUS
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract. We consider the problem of programming distributed embedded real-time systems with distributed dependencies. We show that the de facto standard of using locks and conditi...
RTA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Partial-inversion compilers generate programs which compute some unknown inputs of given programs from a given output and the rest of inputs whose values are already give...
VLDB
1990
ACM
14 years 8 days ago
1990
ACM
Bottom-up evaluation of deductive database programs has the advantage that it avoids repeated computation by storing all intermediate results and replacing recomputation by table ...
NETWORKS
2008
13 years 8 months ago
2008
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...