—As we all know, Hanoi Problem is a classical case of recursive algorithm in programming. In this paper, we study the problem in another way by numbering the peg from bottom to t...
The utilization of cutting planes is a key technique in Integer Linear Programming (ILP). However, cutting planes have seldom been applied in Pseudo-Boolean Optimization (PBO) algo...
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Abstract One of the goals envisioned by Grid computing is to make the execution of both computational and data-intensive problems possible. A key problem is finding the optimal set...
Marc De Leenheer, Pieter Thysebaert, Bruno Volckae...