3758 search results - page 155 / 752 » A Complete Subsumption Algorithm |
DM
1999
14 years 9 months ago
1999
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
119
click to vote
IEEECIT
2010
IEEE
14 years 7 months ago
2010
IEEE
Future systems will have to support multiple and concurrent dynamic compute-intensive applications, while respecting real-time and energy consumption constraints. With the increase...
104
click to vote
TCAD
2011
14 years 5 months ago
2011
—Pre-bond testing of 3-D stacked integrated circuits (ICs) involves testing each individual die before bonding. The overall yield of 3-D ICs improves with pre-bond testability be...
SAS
2012
Springer
13 years 12 days ago
2012
Springer
Programming distributed and reactive asynchronous systems is complex due to the lack of synchronization between concurrently executing tasks, and arbitrary delay of message-based c...
LCPC
1999
Springer
15 years 2 months ago
1999
Springer
Since the C language imposes little restriction on the use of function pointers, the task of call graph construction for a C program is far more di cult than what the algorithms d...