9842 search results - page 1635 / 1969 » The Complexity of the Matching-Cut Problem |
192
click to vote
ASPDAC
2006
ACM
16 years 20 days ago
2006
ACM
Abstract— Substantial attention is being paid to the fault diagnosis problem in recent test literature. Yet, the compaction of test vectors for fault diagnosis is little explored...
154
click to vote
ASPDAC
2006
ACM
16 years 20 days ago
2006
ACM
Commonly used pattern sources in simulation-based verification include random, guided random, or design verification patterns. Although these patterns may help bring the design ...
150
click to vote
MOBICOM
2006
ACM
16 years 20 days ago
2006
ACM
Determining node positions is essential for many next-generation network functionalities. Previous localization algorithms lack correctness guarantees or require network density h...
160
click to vote
MOBICOM
2006
ACM
16 years 20 days ago
2006
ACM
In this paper, we consider the channel assignment problem in single radio multi-channel mobile ad-hoc networks. Specifically, we investigate the granularity of channel assignment...
151
click to vote
APCSAC
2005
IEEE
16 years 10 days ago
2005
IEEE
Moore’s law describes the growth in on-chip transistor density, which doubles every 18 to 24 months and looks set to continue for at least a decade and possibly longer. This grow...