Sciweavers

2398 search results - page 167 / 480
» Constraint Programming and Graph Algorithms
Sort
View
PLDI
2006
ACM
16 years 8 days ago
An experimental analysis of self-adjusting computation
Dependence graphs and memoization can be used to efficiently update the output of a program as the input changes dynamically. Recent work has studied techniques for combining the...
Umut A. Acar, Guy E. Blelloch, Matthias Blume, Kan...
ESOP
1990
Springer
15 years 10 months ago
Algebraic Properties of Program Integration
The need to integrate several versions of a program into a common one arises frequently, but it is a tedious and time consuming task to merge programs by hand. The program-integrat...
Thomas W. Reps
ICPP
2007
IEEE
16 years 19 days ago
Toward Automatic Data Distribution for Migrating Computations
Program parallelization requires mapping computation and data to processing elements. Navigational Programming (NavP), based on the principle of migrating computations, offers a d...
Lei Pan, Jingling Xue, Ming Kin Lai, Michael B. Di...
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
15 years 6 months ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...
ICPP
2002
IEEE
15 years 11 months ago
Power Aware Scheduling for AND/OR Graphs in Multi-Processor Real-Time Systems
Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previousl...
Dakai Zhu, Nevine AbouGhazaleh, Daniel Mossé...