Sciweavers

2498 search results - page 294 / 500
» Data Structures with Unpredictable Timing
Sort
View
ICSM
1999
IEEE
15 years 10 months ago
Building Documentation Generators
In order to maintain the consistency between sources and documentation, while at the same time providing documentation at the design level, it is necessary to generate documentati...
Arie van Deursen, Tobias Kuipers
ESOP
1999
Springer
15 years 10 months ago
Dynamic Programming via Static Incrementalization
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
Yanhong A. Liu, Scott D. Stoller
PPL
2008
75views more  PPL 2008»
15 years 6 months ago
Modeling the Performance of Communication Schemes on Network Topologies
This paper investigates the influence of the interconnection network topology of a parallel system on the delivery time of an ensemble of messages, called the communication scheme...
Jan Lemeire, Erik F. Dirkx, Walter Colitti
ALGORITHMICA
2000
87views more  ALGORITHMICA 2000»
15 years 6 months ago
Linear Size Binary Space Partitions for Uncluttered Scenes
We describe a new and simple method for constructing binary space partitions in arbitrary dimensions. We also introduce the concept of uncluttered scenes, which are scenes with a ...
Mark de Berg
POPL
2008
ACM
16 years 6 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume