This paper considers a flexible flow shop scheduling problem, where at least one production stage is made up of unrelated parallel machines. Moreover, sequenceand machinedependent setup times are given. The objective is to find a schedule that minimizes a positively weighted convex sum of makespan and the number of tardy jobs in a static flexible flow shop environment. For this problem, a 0-1 m...

This paper presents two novel heuristic algorithms for the design of wireless access networks laying special emphasis to the design of indoor CDMA based and Fixed Wireless networks. Both methods are based on Graph Theory and they are essentially greedy algorithms. The first objective of the two heuristics is to place a number of access points/base stations in a number of candidate sites and the...

A major issue in the design and operation of ad hoc networks is sharing the common spectrum among links in the same geographic area. Bandwidth allocation, to optimize the performance of networks in which each station can converse with at most a single neighbor at a time, has been recently studied in the context of Bluetooth networks. There, centralized and distributed, capacity assignment heuri...

First-order theorem provers have to search for proofs in an infinite space of possible derivations. Proof search heuristics play a vital role for the practical performance of these systems. In the current generation of saturation-based theorem provers like SPASS, E, Vampire or Prover 9, one of the most important decisions is the selection of the next clause to process with the given clause algo...

We present an efficient software package for computing homology of sets, maps and filtrations represented as cubical, simplicial and regular CW complexes. The core homology computation is based on classical Smith diagonalization, but the efficiency of our approach comes from applying several geometric and algebraic reduction techniques combined with smart implementation.