602 search results - page 74 / 121 » Unsupervised Problem Decomposition Using Genetic Programming |
ICALP
2010
Springer
14 years 3 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
CP
2005
Springer
14 years 4 months ago
2005
Springer
In this paper, we present an algorithm for finding utilitarian optimal solutions to Simple and Disjunctive Temporal Problems with Preferences (STPPs and DTPPs) based on Benders’...
CVPR
2010
IEEE
13 years 9 months ago
2010
IEEE
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
PLDI
2003
ACM
14 years 4 months ago
2003
ACM
An adaptation of the classic register allocation algorithm to the problem of array storage optimization in MATLAB is presented. The method involves the decomposition of an interfe...
BMCBI
2008
13 years 11 months ago
2008
Background: Many common disorders have multiple genetic components which convey increased susceptibility. SNPs have been used to identify genetic components which are associated w...