1118 search results - page 130 / 224 » Convex Optimization |
NIPS
2007
13 years 10 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
TMC
2012
11 years 11 months ago
2012
—This article1 presents the design of a networked system for joint compression, rate control and error correction of video over resource-constrained embedded devices based on the...
ATMOS
2010
13 years 8 months ago
2010
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
Westudyjobschedulingonprocessorscapableofrunningatvariablevoltage/speed tominimizeenergyconsumption.Eachjob ina probleminstanceisspecifiedbyitsarrivaltime and deadline, together w...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. A mobile robot, represented by a point moving along a polygonal line in the plane, has to explore an unknown polygon and return to the starting point. The robot has a sen...