547 search results - page 56 / 110 » Preference-Based Search for Scheduling |
100
Voted
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
Optimal resource scheduling in multiagent systems is a computationally challenging task, particularly when the values of resources are not additive. We consider the combinatorial ...
104
click to vote
AIPS
2006
15 years 2 months ago
2006
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
101
click to vote
AIM
2004
15 years 16 days ago
2004
Satellite domains are becoming a fashionable area of research within the AI community due to the complexity of the problems that these domains need to solve. With the current US a...
96
Voted
KBS
2007
15 years 15 days ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
132
click to vote
IHI
2010
14 years 7 months ago
2010
The processes carried out in a hospital emergency department can be thought of as structures of activities that require resources in order to execute. Costs are reduced when resou...