151 search results - page 7 / 31 » Computable Shell Decomposition Bounds |
ICML
2003
IEEE
14 years 9 months ago
2003
IEEE
We analyze the formal grounding behind Negative Correlation (NC) Learning, an ensemble learning technique developed in the evolutionary computation literature. We show that by rem...
EVOW
2010
Springer
14 years 13 days ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
JC
2010
13 years 6 months ago
2010
We present a new general class of methods for the computation of high-dimensional integrals. The quadrature schemes result by truncation and discretization of the anchored-ANOVA d...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
MOC
1998
13 years 8 months ago
1998
In this paper we construct and analyze new non-overlapping domain decomposition preconditioners for the solution of second-order elliptic and parabolic boundary value problems. The...