703 search results - page 25 / 141 » Maintenance scheduling problems as benchmarks for constraint... |
ECRTS
1999
IEEE
13 years 11 months ago
1999
IEEE
Despite the significant body of results in real-time scheduling, many real world problems are not easily supported. While algorithms such as Earliest Deadline First, Rate Monotoni...
ICLP
1999
Springer
13 years 11 months ago
1999
Springer
Fair allocation of payoffs among cooperating players who can form various coalitions of differing utilities is the classic game theoretic “coalition problem.” Shapley’s va...
AICCSA
2006
IEEE
14 years 1 months ago
2006
IEEE
: The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the ...
IEAAIE
2001
Springer
13 years 12 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...