1647 search results - page 226 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
109
click to vote
COR
2010
15 years 2 months ago
2010
We present a memetic approach for multi-objective improvement of robustness influencing features (called robustness objectives) in airline schedules. Improvement of the objectives...
132
click to vote
FCT
2007
Springer
15 years 8 months ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
139
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
134
click to vote
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
115
Voted
PKDD
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The Factored Markov Decision Process (FMDP) framework is a standard representation for sequential decision problems under uncertainty where the state is represented as a ...