465 search results - page 85 / 93 » On the Hardness of Range Assignment Problems |
MOBIHOC
2009
ACM
16 years 9 days ago
2009
ACM
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
128
click to vote
KDD
2008
ACM
16 years 5 days ago
2008
ACM
Many time series prediction methods have focused on single step or short term prediction problems due to the inherent difficulty in controlling the propagation of errors from one ...
106
click to vote
KDD
2006
ACM
16 years 5 days ago
2006
ACM
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
KDD
2005
ACM
16 years 5 days ago
2005
ACM
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
103
click to vote
HPCA
2002
IEEE
16 years 4 days ago
2002
IEEE
Clusters of high-end workstations and PCs are currently used in many application domains to perform large-scale computations or as scalable servers for I/O bound tasks. Although c...