Showing papers on "Admissible heuristic published in 1995"

Fighting space complexity of compile time cache management schemes

Abstract: Compile time optimizations have been an intensive research area in uniprocessor environment. However, due the NP-completness of most of the problems dealt with and the various nature of programs, these optimizations have been applied with various successes. While in many cases it is theoretically possible to solve the problems, in practice the proposed methods run into space or/and time problems. In this paper, we propose the use of a linear space algorithm for the data cache compile time management problem and propose an admissible heuristic.

A State Space Approach for Solving Project Scheduling Problems

Abstract: The propose a state space approach for representing project scheduling problems with resource constraints. This state space representation will enable the applications of many currently available state space based heuristic research methods. We apply an admissible heuristic search method to demonstrate the application process in finding the optimal schedule. In formulating a project scheduling problem into a state space problem we base on the dynamic nature of the resource availability of project scheduling operations to define estates state transition operator, and state transition costs. We also utilize the inherent network features of the project scheduling problems to suggest ways to obtain good initial heuristic estimates to facilitate the applications of heuristic search methods.