5889 search results - page 960 / 1178 » Graph Layout Problems |
179
click to vote
TAPSOFT
1997
Springer
15 years 10 months ago
1997
Springer
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
163
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
167
click to vote
ICCAD
1992
IEEE
15 years 10 months ago
1992
IEEE
High-level synthesis (HLS) requires more designer interaction to better meet the needs of experienced designers. However, attempts to create a highly interactive synthesis process...
154
click to vote
COMPGEOM
1990
ACM
15 years 10 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
179
click to vote
LICS
1990
IEEE
15 years 10 months ago
1990
IEEE
E cient automatic model checking algorithms for real-time systems have been obtained in recent years based on the state region graph technique of Alur, Courcoubetis and Dill. Howev...