8647 search results - page 419 / 1730 » The Container Selection Problem |
103
click to vote
ICS
2010
Tsinghua U.
15 years 9 months ago
2010
Tsinghua U.
: Maximizing revenue in the presence of perfectly informed players is a well known goal in mechanism design. Yet, all current mechanisms for this goal are vulnerable to equilibrium...
132
click to vote
IJCAI
2007
15 years 6 months ago
2007
We present MBoost, a novel extension to AdaBoost that extends boosting to use multiple weak learners explicitly, and provides robustness to learning models that overfit or are po...
138
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
141
click to vote
OPODIS
2007
15 years 6 months ago
2007
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
161
Voted
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
Selective sampling is a form of active learning which can reduce the cost of training by only drawing informative data points into the training set. This selected training set is ...