3428 search results - page 147 / 686 » Making the Case |
111
click to vote
CASES
2007
ACM
15 years 8 months ago
2007
ACM
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...
130
click to vote
WSC
2007
15 years 6 months ago
2007
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...
135
click to vote
FORTE
2004
15 years 5 months ago
2004
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...
123
Voted
NETWORKS
2010
15 years 2 months ago
2010
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...
135
click to vote
CASES
2009
ACM
15 years 1 months ago
2009
ACM
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...