1725 search results - page 35 / 345 » Relaxed genetic programming |
SIAMJO
2010
13 years 4 months ago
2010
We present a general semidefinite relaxation scheme for general n-variate quartic polynomial optimization under homogeneous quadratic constraints. Unlike the existing sum-of-squar...
ICASSP
2010
IEEE
13 years 10 months ago
2010
IEEE
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
JMLR
2010
13 years 4 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
IPCO
2008
13 years 11 months ago
2008
Recent advances on the understanding of valid inequalities from the infinite group relaxation has opened the possibility of finding a computationally effective extension to GMI cu...
IFIP
2010
Springer
13 years 8 months ago
2010
Springer
In online shopping scenarios, it can be difficult for consumers to process the vast amounts of information available and to make satisfactory buying decisions. Interactive decision...