246 search results - page 34 / 50 » Dynamic Local Search for the Maximum Clique Problem |
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract-- A novel algorithm to solve constrained realparameter optimization problems, based on the Artificial Bee Colony algorithm is introduced in this paper. The operators used ...
AAAI
2008
14 years 12 months ago
2008
We present a novel method for information-theoretic exploration, leveraging recent work on mapping and localization. We describe exploration as the constrained optimization proble...
104
click to vote
BIBE
2008
IEEE
15 years 4 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
CVBIA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. A method for the non-rigid, multi-modal, registration of volumetric scans of human hands is presented. PET and MR scans are aligned by optimising the configuration of a ...
IAT
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper, we consider the problem of dynamic lightpath protection in survivable WDM networks with single link failure model. Our work concerns in how to dynamically determine...