Supply chains are faced with a rising complexity of products, structures, and processes. Because of the strong link between a supply chain’s complexity and its efficiency the supply chain complexity management becomes a major challenge of today’s business management. A two dimensional driver concept is introduced and explained to comprehend the major causes of a supply chains’ complexity. To ma...

A new genetic algorithm based on multi niche crowding is capable of efficiently locating all the peaks of a multi-modal function. By associating these peaks with the utility accrued from different sets of decision variables it is possible to extend the use of genetic algorithms to multi criteria decision making problems. This concept is applied to address the problems arising in the context of ...

The scheduling of tasks and the allocation of resource in medium to large-scale development projects is an extremely hard problem and is one of the principal challenges of project management due to its sheer complexity. As projects evolve any solutions, either optimal or near optimal, must be continuously scrutinized in order to adjust to changing conditions. Brute force exhaustive or branch-an...

We present two new algorithms for contention management in transactional memory, the deterministic algorithm CommitRounds and the randomized algorithm RandomizedRounds. Our randomized algorithm is efficient: in some notorious problem instances (e.g., dining philosophers) it is exponentially faster than prior work from a worst case perspective. Both algorithms are (i) local and (ii) starvation-f...

The content-based retrieval of diffusion magnetic resonance (dMR) imaging data would enable a wide range of analyses on large databases with dMR images.This paper proposes a content-based retrieval framework for dMR images to explore the use of Diffusion Tensor Imaging (DTI) derived parameters. The propagation graph algorithm is proposed for the query-centric retrieval of dMR subjects and the f...

This article studies how a mechanism designer can influence games by promising payments to the players depending on their mutual choice of strategies. First, we investigate the cost of implementing a desirable behavior and present algorithms to compute this cost. Whereas a mechanism designer can decide efficiently whether strategy profiles can be implemented at no cost at all our complexity ana...