6740 search results - page 1259 / 1348 » An s -Hamiltonian Line Graph Problem |
117
click to vote
CC
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. A key scalability challenge for interprocedural dataflow analysis comes from large libraries. Our work addresses this challenge for the general category of interprocedura...
CDC
2008
IEEE
15 years 1 months ago
2008
IEEE
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (contPN). Specifically, we consider two problems: (1) given an initial set o...
122
click to vote
ITP
2010
15 years 1 months ago
2010
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
101
click to vote
DATE
2005
IEEE
15 years 1 months ago
2005
IEEE
Memory space limitation is a serious problem for many embedded systems from diverse application domains. While circuit/packaging techniques are definitely important to squeeze la...
COCO
2008
Springer
15 years 1 months ago
2008
Springer
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...