4860 search results - page 365 / 972 » SNPs Problems, Complexity, and Algorithms |
113
Voted
DAGSTUHL
2007
15 years 5 months ago
2007
Approximations can aim at having close to optimal value or, alternatively, they can aim at structurally resembling an optimal solution. Whereas value-approximation has been extensi...
149
Voted
SOFSEM
2000
Springer
15 years 7 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
154
Voted
STACS
2012
Springer
13 years 11 months ago
2012
Springer
Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different...
148
Voted
MDM
2009
Springer
15 years 10 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
143
Voted
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
We propose a cooperative-coevolution – Parisian trend – algorithm, IMPEA (Independence Model based Parisian EA), to the problem of Bayesian networks structure estimation. It i...