In computer games, one or more groups of units need to move from one location to another as quickly as possible. If there is only one group, then it can be solved efficiently as a ...
Marjan van den Akker, Roland Geraerts, Han Hoogeve...
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
In this paper, we particularly focused our attention on how to enhance expressivity of ontologies when used as organized space values in a catalogue request process. Using the Wis...
: Nowadays information systems are required to adapt themselves dynamically to the ever changing environment and requirements. Architectural reflection represents a principled mean...