5100 search results - page 942 / 1020 » The Linear Complexity of a Graph |
139
click to vote
ICCAD
2006
IEEE
16 years 1 months ago
2006
IEEE
Parametric yield loss due to variability can be effectively reduced by both design-time optimization strategies and by adjusting circuit parameters to the realizations of variable...
127
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested agents. Specifically, we consider the case where issues are divisible, there are time constraints in ...
135
click to vote
EMSOFT
2009
Springer
15 years 11 months ago
2009
Springer
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...
146
click to vote
WCNC
2008
IEEE
15 years 11 months ago
2008
IEEE
—Iterative K-best sphere detection (SD) and channel decoding is appealing, since it is capable of achieving a nearmaximum-a-posteriori (MAP) performance at a low complexity. Howe...
151
click to vote
DASFAA
2007
IEEE
15 years 11 months ago
2007
IEEE
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...