4469 search results - page 524 / 894 » Dynamic Program Slicing |
186
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
Executing subordinate activities by pushing return addresses on the stack is the most e cient working mode for sequential programs. It is supported by all current processors, yet i...
182
Voted
ICCAD
1998
IEEE
15 years 11 months ago
1998
IEEE
- This paper presents an optimal algorithm for solving the problem of simultaneous fanout optimization and routing tree construction for an ordered set of critical sinks. The algor...
178
click to vote
AGENTS
1998
Springer
15 years 11 months ago
1998
Springer
Mobile agents are programs that can migrate from machine to machine in a heterogeneous, partially disconnected network. As mobile agents move across a network, they consume resour...
168
click to vote
ICCAD
1997
IEEE
15 years 11 months ago
1997
IEEE
In this paper, we present an optimal algorithm for solving the simultaneous technology mapping and linear placement problem for tree-structured circuits with the objective of mini...
180
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...