874 search results - page 6 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
MAGS
2008
14 years 9 months ago
2008
This paper is about business modelling and negotiation protocol design in distributed scheduling, where individual agents have individual (potentially conflicting) interests. It i...
EUSFLAT
2001
14 years 11 months ago
2001
A single machine scheduling problem with parameters given in the form of fuzzy numbers is considered. It is assumed that the optimal schedule in such a problem cannot be determine...
SPAA
2006
ACM
15 years 3 months ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
104
click to vote
AAAI
2000
14 years 11 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
This paper formally presents the resident physician scheduling problem, which is one of the most important scheduling problems in hospital. The resident physician scheduling probl...