Ready for that long-awaited summer vacation? First, you'll need to pack all items required for your trip into a suitcase, making sure everything fits securely without crushing anything fragile.

Abstract: We propose and evaluate a parallel "decomposite best-first" search branch-and-bound algorithm (dbs) for MIN-based multiprocessor systems. We start with a new probabilistic model to estimate ...

The amortized time complexity of the proposed parallel scheduling algorithm, in terms of the time to compute a matching in a timeslot, is O(log N), where N is the switch size. As for the scalability ...