The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
Abstract. Scheduling the execution of multiple concurrent tasks on shared resources such as CPUs and network links is essential to ensuring the reliable operation of many autonomic...
Terry Tidwell, Robert Glaubius, Christopher D. Gil...
d Abstract) David Kitchin, Evan Powell, and Jayadev Misra The University of Texas at Austin The real world is inherently concurrent and temporal. For simulating physical phenomena ...
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, we propose an O(n4...
We extend the framework of mixed multi-unit combinatorial auctions to include time constraints, present an expressive bidding language, and show how to solve the winner determinati...