1629 search results - page 4 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
101
click to vote
AI
2006
Springer
14 years 9 months ago
2006
Springer
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
112
click to vote
EUC
2006
Springer
15 years 1 months ago
2006
Springer
Multicore processors promise higher throughput at lower power consumption than single core processors. Thus in the near future they will be widely used in hard real-time systems as...
66
Voted
DAC
1998
ACM
15 years 1 months ago
1998
ACM
This papers describes a new, fast and economical methodology to test linear analog circuits based on adaptive algorithms. To the authors knowledge, this is the first time such tec...
111
click to vote
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Energy consumption is a critical design issue in real-time systems, especially in battery- operated systems. Maintaining high performance, while extending the battery life between...
DAM
2011
14 years 4 months ago
2011
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...