1984 search results - page 317 / 397 » Variable mesh optimization for continuous optimization probl... |
112
click to vote
Publication
In this paper we describe a new class of representations for realvalued parameters called Center of Mass Encoding (CoME). CoME is based on variable length strings, it is self-adap...
109
Voted
AI
1999
Springer
15 years 2 months ago
1999
Springer
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
158
Voted
JMLR
2010
14 years 9 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...
103
Voted
CP
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Cost-based filtering is a novel approach that combines techniques from Operations Research and Constraint Programming to filter from decision variable domains values that...
192
click to vote
CAD
2011
Springer
14 years 9 months ago
2011
Springer
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...