3172 search results - page 185 / 635 » On the Random-Self-Reducibility of Complete Sets |
141
click to vote
FPL
2005
Springer
16 years 1 days ago
2005
Springer
This work explores the effect of adding a timing driven functional decomposition step to the traditional field programmable gate array (FPGA) CAD flow. Once placement has comple...
130
click to vote
GRID
2005
Springer
16 years 1 days ago
2005
Springer
— QoS and congestion performance are crucial to good application performance in a utility computing environment. Unfortunately, proper IP QoS setup is very complex and is either ...
160
click to vote
IFM
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. We present a fixpoint semantics of event systems. The semantics is presented in a general framework without concerns of fairness. Soundness and completeness of rules for...
153
click to vote
ISAAC
2005
Springer
16 years 1 days ago
2005
Springer
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
186
click to vote
PAKDD
2005
ACM
16 years 16 hour ago
2005
ACM
Traditional association rules mining cannot meet the demands arising from some real applications. By considering the different values of individual items as utilities, utility mini...