3096 search results - page 199 / 620 » The Generalized FITC Approximation |
148
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...
137
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
Recent advances in XCS technology have shown that selfadaptive mutation can be highly useful to speed-up the evolutionary progress in XCS. Moreover, recent publications have shown...
148
click to vote
IFIP
2004
Springer
15 years 10 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
121
Voted
NIPS
2003
15 years 6 months ago
2003
A general linear response method for deriving improved estimates of correlations in the variational Bayes framework is presented. Three applications are given and it is discussed ...
149
click to vote
CIBCB
2007
IEEE
15 years 11 months ago
2007
IEEE
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...