1454 search results - page 68 / 291 » Learning with cost intervals |
133
click to vote
CPAIOR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
172
click to vote
AISC
2008
Springer
15 years 7 months ago
2008
Springer
Because of the importance of special functions, several books and a large collection of papers have been devoted to the numerical computation of these functions, the most well-know...
133
click to vote
AIPS
2006
15 years 6 months ago
2006
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals...
139
click to vote
JAL
2007
15 years 5 months ago
2007
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...
134
click to vote
4OR
2004
15 years 5 months ago
2004
This paper presents upper bounds for the Satellite Revenue Selection and Scheduling problem (SRSS). A compact model of this generalized Prize Collecting Traveling Salesman Problem ...