2636 search results - page 408 / 528 » Linear Programming |
126
click to vote
DAC
2005
ACM
15 years 4 months ago
2005
ACM
This paper presents a new method for designing test wrappers for embedded cores with multiple clock domains. By exploiting the use of multiple shift frequencies, the proposed meth...
112
Voted
CSR
2008
Springer
15 years 4 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
128
Voted
ECAI
2008
Springer
15 years 4 months ago
2008
Springer
Automation of Web service composition is one of the most interesting challenges facing the Semantic Web today. Since Web services have been enhanced with formal semantic descriptio...
124
Voted
ESA
2008
Springer
15 years 4 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
126
click to vote
EUROPAR
2008
Springer
15 years 4 months ago
2008
Springer
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number o...