222 search results - page 36 / 45 » Approximation Algorithms for the Job Interval Selection Prob... |
SODA
2012
ACM
11 years 11 months ago
2012
ACM
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
AAAI
2007
13 years 11 months ago
2007
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
ESANN
2001
13 years 10 months ago
2001
This paper describes a method of supervised learning based on forward selection branching. This method improves fault tolerance by means of combining information related to general...
JAIR
2010
13 years 7 months ago
2010
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
CONSTRAINTS
1998
13 years 8 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...