Sciweavers

1225 search results - page 52 / 245
» The Instance Complexity Conjecture
Sort
View
WG
2004
Springer
16 years 9 days ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...
177
Voted
AAAI
2000
15 years 8 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
DAWAK
2010
Springer
15 years 7 months ago
Modelling Complex Data by Learning Which Variable to Construct
Abstract. This paper addresses a task of variable selection which consists in choosing a subset of variables that is sufficient to predict the target label well. Here instead of tr...
Françoise Fessant, Aurélie Le Cam, M...
173
Voted
DISOPT
2010
129views more  DISOPT 2010»
15 years 7 months ago
Labeled Traveling Salesman Problems: Complexity and approximation
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
Basile Couëtoux, Laurent Gourvès, J&ea...
JMLR
2010
136views more  JMLR 2010»
15 years 1 months ago
Reducing Label Complexity by Learning From Bags
We consider a supervised learning setting in which the main cost of learning is the number of training labels and one can obtain a single label for a bag of examples, indicating o...
Sivan Sabato, Nathan Srebro, Naftali Tishby