4378 search results - page 773 / 876 » On the Complexity of Ordered Colourings |
177
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Searching and extracting meaningful information out of highly heterogeneous datasets is a hot topic that received a lot of attention. However, the existing solutions are based on e...
172
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
203
click to vote
EUROSYS
2006
ACM
16 years 3 months ago
2006
ACM
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
175
click to vote
ICCAD
2004
IEEE
16 years 3 months ago
2004
IEEE
—In this paper, we present a new block budgeting algorithm which speeds up timing closure in timing driven hierarchical flows. After a brief description of the addressed flow, ...
156
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
— In this paper, we present a high-level power model to estimate the power consumption in semi-global and global interconnects. Such interconnects are used for communications bet...