2778 search results - page 117 / 556 » Limit complexities revisited |
127
click to vote
DAC
2005
ACM
16 years 5 months ago
2005
ACM
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
124
click to vote
STOC
2002
ACM
16 years 5 months ago
2002
ACM
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent o...
ICCD
2002
IEEE
16 years 1 months ago
2002
IEEE
Dynamically-loaded tagless loop caching reduces instruction fetch power for embedded software with small loops, but only supports simple loops without taken branches. Preloaded ta...
125
click to vote
ICDAR
2009
IEEE
15 years 11 months ago
2009
IEEE
Table analysis is a complex problem, involving searching solutions from a large search space. Studies show that finding the most credible answers to complex problems often requir...
127
click to vote
RTSS
2009
IEEE
15 years 11 months ago
2009
IEEE
In complex hard real-time systems with tight constraints on system resources, small changes in one component of a system can cause a cascade of adverse effects on other parts of t...