We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
Michael Alekhnovich, Allan Borodin, Joshua Buresh-...
We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. Our example is a formalism aiming at capturing causal explanation...
This paper presents a high performance communication system based on generic programming. The system adapts itself according to the protocol being used on communication, simplifyi...
: A computer program has been developed to aid the analysis of molecular dynamics trajectories. The program is tuned for macromolecular large-scale problems and supports features s...
The development of grid algorithms is frequently hampered by limited means to describe topologies and lack of support for the invasive composition of legacy components in order to...