2398 search results - page 251 / 480 » Constraint Programming and Graph Algorithms |
145
click to vote
SAS
1999
Springer
15 years 10 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
284
click to vote
POPL
2003
ACM
16 years 6 months ago
2003
ACM
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
171
click to vote
SIGSOFT
1995
ACM
15 years 10 months ago
1995
ACM
The notion of a program slice, originally introduced by Mark Weiser, is a fundamental operation for addressing many software-engineering problems, including program understanding,...
181
Voted
GPCE
2009
Springer
15 years 11 months ago
2009
Springer
User interfaces for modern applications must support a rich set of interactive features. It is commonplace to find applications with dependencies between values manipulated by us...
182
Voted
DAM
2007
15 years 6 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...