604 search results - page 52 / 121 » On the Complexity of the Maximum Cut Problem |
145
click to vote
WSC
2007
15 years 8 months ago
2007
The Cross-Entropy (CE) method is a modern and effective optimization method well suited to parallel implementations. There is a vast array of problems today, some of which are hig...
168
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 1 months ago
2010
Eurographics
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads ...
118
click to vote
NAACL
2007
15 years 7 months ago
2007
We relate the problem of finding the best application of a Synchronous ContextFree Grammar (SCFG) rule during parsing to a Markov Random Field. This representation allows us to u...
132
click to vote
UAI
1996
15 years 7 months ago
1996
Probabilistic inference algorithms for belief updating, nding the most probable explanation, the maximum a posteriori hypothesis, and the maximum expected utility are reformulated...
171
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...