1844 search results - page 96 / 369 » Exploiting the Structure of Distributed Constraint Optimizat... |
IROS
2006
IEEE
15 years 5 months ago
2006
IEEE
— A new biped gait generation and optimization method is proposed in the frame of Estimation of Distribution Algorithms (EDAs) with Q-learning method. By formulating the biped ga...
126
click to vote
JMLR
2010
14 years 6 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...
116
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
IAT
2007
IEEE
15 years 5 months ago
2007
IEEE
We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decis...
EMNLP
2008
15 years 28 days ago
2008
Minimum-error-rate training (MERT) is a bottleneck for current development in statistical machine translation because it is limited in the number of weights it can reliably optimi...