1963 search results - page 226 / 393 » The Maximum Solution Problem on Graphs |
169
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—In modern sub-micron design, achieving low-skew clock distributions is facing challenges for high-performance circuits. Symmetric global clock distribution and clock tree synthe...
150
click to vote
FOCS
1993
IEEE
15 years 10 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
161
click to vote
AAAI
2008
15 years 9 months ago
2008
We present a novel method for information-theoretic exploration, leveraging recent work on mapping and localization. We describe exploration as the constrained optimization proble...
153
click to vote
TC
1998
15 years 6 months ago
1998
—Many built-in self-testing (BIST) schemes compress the test responses from a k-output circuit to q signature streams, where q << k, a process termed space compaction. The ...
195
click to vote
NETWORKS
2007
15 years 6 months ago
2007
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...