Sciweavers

21 search results - page 4 / 5
» Minimizing the earliness-tardiness costs on a single machine
Sort
View
JMLR
2006
96views more  JMLR 2006»
13 years 7 months ago
A Hierarchy of Support Vector Machines for Pattern Detection
We introduce a computational design for pattern detection based on a tree-structured network of support vector machines (SVMs). An SVM is associated with each cell in a recursive ...
Hichem Sahbi, Donald Geman
MFCS
2009
Springer
14 years 1 months ago
Private Capacities in Mechanism Design
Algorithmic mechanism design considers distributed settings where the participants, termed agents, cannot be assumed to follow the protocol but rather their own interests. The pro...
Vincenzo Auletta, Paolo Penna, Giuseppe Persiano
CPAIOR
2007
Springer
14 years 1 months ago
A Global Constraint for Total Weighted Completion Time
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, an O(n4 ) algorithm...
András Kovács, J. Christopher Beck
WAOA
2010
Springer
256views Algorithms» more  WAOA 2010»
13 years 5 months ago
The Train Delivery Problem - Vehicle Routing Meets Bin Packing
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
Aparna Das, Claire Mathieu, Shay Mozes
ICML
1999
IEEE
14 years 8 months ago
Lazy Bayesian Rules: A Lazy Semi-Naive Bayesian Learning Technique Competitive to Boosting Decision Trees
Lbr is a lazy semi-naive Bayesian classi er learning technique, designed to alleviate the attribute interdependence problem of naive Bayesian classi cation. To classify a test exa...
Zijian Zheng, Geoffrey I. Webb, Kai Ming Ting