Sciweavers

5314 search results - page 346 / 1063
» Hybrid Dynamic Programming
Sort
View
SODA
2004
ACM
161views Algorithms» more  SODA 2004»
15 years 8 months ago
Approximation schemes for Metric Bisection and partitioning
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...
VL
2005
IEEE
104views Visual Languages» more  VL 2005»
16 years 7 days ago
Using a Molecular Metaphor to Facilitate Comprehension of 3D Object Diagrams
This paper presents a strategy for the visualization of dynamic object relationships in Java programs. The metaphor of a chemical molecule is used to aid comprehension, and to hel...
Brian A. Malloy, James F. Power
PDPTA
1996
15 years 8 months ago
Exploiting Task-Level Parallelism Using pTask
This paper presents pTask-- a system that allows users to automatically exploit dynamic task-level parallelism in sequential array-based C programs. The system employs compiler an...
Tarek S. Abdelrahman, Sum Huynh
OOPSLA
2005
Springer
16 years 4 days ago
Subtext: uncovering the simplicity of programming
Representing programs as text strings makes programming harder then it has to be. The source text of a program is far removed from its behavior. Bridging this conceptual gulf is w...
Jonathan Edwards
ECOOP
2000
Springer
15 years 11 months ago
Ionic Types
Abstract. We are interested in the class of systems for which the satisfaction of code dependencies is a dynamic process rather than one which is determined purely at load-time. Ex...
Simon A. Dobson, Brian Matthews