159 search results - page 22 / 32 » Computing minimum cuts by randomized search heuristics |
BMCBI
2010
15 years 15 days ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
124
Voted
DCOSS
2011
Springer
14 years 5 days ago
2011
Springer
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
107
click to vote
TOG
2002
15 years 12 hour ago
2002
There are many applications that demand large quantities of natural looking motion. It is difficult to synthesize motion that looks natural, particularly when it is people who mus...
96
Voted
EVOW
2010
Springer
15 years 4 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
120
click to vote
FSTTCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...