2244 search results - page 67 / 449 » A new heuristic approach for non-convex optimization problem... |
163
click to vote
EVOW
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The quadratic assignment problem arises in a variety of practical settings. It is known to be among the hardest combinatorial problems for exact algorithms. Therefore, a ...
175
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...
232
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
168
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
For various 3D shape analysis tasks, the LaplaceBeltrami(LB) embedding has become increasingly popular as it enables the efficient comparison of shapes based on intrinsic geometry...
138
click to vote
KI
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. Many heuristic estimators for classical planning are based on the socalled delete relaxation, which ignores negative effects of planning operators. Ideally, such heuristi...