Sciweavers

454 search results - page 74 / 91
» Visualization of Program Dependence Graphs
Sort
View
ICALP
2001
Springer
14 years 2 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
ICSM
2005
IEEE
14 years 3 months ago
Static Analysis of Object References in RMI-Based Java Software
Distributed applications provide numerous advantages related to software performance, reliability, interoperability, and extensibility. This paper focuses on distributed Java prog...
Mariana Sharp, Atanas Rountev
CC
2004
Springer
14 years 3 months ago
Using Multiple Memory Access Instructions for Reducing Code Size
An important issue in embedded systems design is the size of programs. As computing devices decrease in size, yet with more and more functions, better code size optimizations are i...
Neil Johnson, Alan Mycroft
CP
2003
Springer
14 years 3 months ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann
TOOLS
2000
IEEE
14 years 2 months ago
Algorithmic Analysis of the Impacts of Changes to Object-Oriented Software
The research presented here addresses the problem of change impact analysis CIA for object-oriented software. A major problem for developers in an evolutionary environment is th...
Michelle Lee, A. Jefferson Offutt, Roger T. Alexan...