Sciweavers

3428 search results - page 147 / 686
» Making the Case
Sort
View
CASES
2007
ACM
15 years 3 months ago
An optimistic and conservative register assignment heuristic for chordal graphs
This paper presents a new register assignment heuristic for procedures in SSA Form, whose interference graphs are chordal; the heuristic is called optimistic chordal coloring (OCC...
Philip Brisk, Ajay K. Verma, Paolo Ienne
87
Voted
WSC
2007
15 years 1 months ago
Measuring manufacturing throughput using takt time analysis and simulation
This paper is motivated by a case study performed at a company that manufactures two main types of customized products. In an effort to significantly increase their throughput cap...
Jun Duanmu, Kevin Taaffe
FORTE
2004
15 years 13 days ago
Formal Composition of Distributed Scenarios
Eliciting, modeling, and analyzing the requirements are the main challenges to face up when you want to produce a formal specification for distributed systems. The distribution and...
Aziz Salah, Rabeb Mizouni, Rachida Dssouli, Benoit...
NETWORKS
2010
14 years 9 months ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum
CASES
2009
ACM
14 years 8 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis