4860 search results - page 397 / 972 » SNPs Problems, Complexity, and Algorithms |
140
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
135
click to vote
CPM
2004
Springer
15 years 7 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
130
click to vote
PODC
2005
ACM
15 years 9 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
159
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
119
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...