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. One of the most successful approaches in automated planning is to use heuristic state-space search. A popular heuristic that is used by a number of state-space planners i...
Menkes van den Briel, J. Benton, Subbarao Kambhamp...
Abstract. We consider a new discriminative learning approach to sequence labeling based on the statistical concept of the Z-score. Given a training set of pairs of hidden-observed ...
role assignment is a programming abstraction that supports the assignment of user-defined roles to sensor nodes such that certain conditions are met. Many common network configu...
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...