4131 search results - page 357 / 827 » The Generalized Max-Controlled Set Problem |
130
Voted
COCO
1995
Springer
15 years 8 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
159
click to vote
AUSAI
2008
Springer
15 years 7 months ago
2008
Springer
Classifiers are traditionally learned using sets of positive and negative training examples. However, often a classifier is required, but for training only an incomplete set of pos...
148
click to vote
ISLPED
2007
ACM
15 years 6 months ago
2007
ACM
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...
135
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
144
click to vote
JAIR
2008
15 years 4 months ago
2008
Reasoning about agent preferences on a set of alternatives, and the aggregation of such preferences into some social ranking is a fundamental issue in reasoning about multi-agent ...