3875 search results - page 539 / 775 » Approximation algorithms for the 0-extension problem |
179
click to vote
ASPDAC
2008
ACM
15 years 8 months ago
2008
ACM
Abstract-- We address performance maximization of independent task sets under energy constraint on chip multi-processor (CMP) architectures that support multiple voltage/frequency ...
182
click to vote
ESANN
2007
15 years 8 months ago
2007
Due to the scale and computational complexity of current simulation codes, metamodels (or surrogate models) have become indispensable tools for exploring and understanding the desi...
158
click to vote
IJCAI
2007
15 years 8 months ago
2007
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods which quickly converge to an approximate solution for medium-sized problems...
195
click to vote
AAAI
2006
15 years 8 months ago
2006
Evaluating text fragments for positive and negative subjective expressions and their strength can be important in applications such as single- or multi- document summarization, do...
168
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...