904 search results - page 132 / 181 » Scheduling task graphs optimally with A |
162
Voted
EMSOFT
2004
Springer
15 years 8 months ago
2004
Springer
In current embedded systems, one of the major concerns is energy conservation. The dynamic voltage-scheduling (DVS) framework, which involves dynamically adjusting the voltage and...
132
Voted
UAI
2004
15 years 4 months ago
2004
Generalized belief propagation (GBP) has proven to be a promising technique for approximate inference tasks in AI and machine learning. However, the choice of a good set of cluste...
132
Voted
CORR
2010
Springer
15 years 2 days ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
137
Voted
WEA
2010
Springer
15 years 8 months ago
2010
Springer
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
125
click to vote
AAIM
2009
Springer
15 years 10 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...