836 search results - page 67 / 168 » On the Complexity of Train Assignment Problems |
145
click to vote
WSDM
2009
ACM
15 years 10 months ago
2009
ACM
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
135
click to vote
ICDE
2008
IEEE
15 years 10 months ago
2008
IEEE
— We propose a new approach to the problem of schema matching in relational databases that merges the hybrid and composite approach of combining multiple individual matching tech...
136
click to vote
COLT
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We study the problem of learning partitions using equivalence constraints as input. This is a binary classification problem in the product space of pairs of datapoints. ...
144
click to vote
WSC
2008
15 years 6 months ago
2008
In an assembly line with high labor proportion, the workforce planning and scheduling is a very complex problem. At the background of increasing labor costs, it is very important ...
132
click to vote
ICDCN
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...