246 search results - page 29 / 50 » Dynamic Local Search for the Maximum Clique Problem |
AIPS
2006
14 years 11 months ago
2006
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
ANOR
2010
14 years 9 months ago
2010
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
99
Voted
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
Active Shape Model is an efficient way for localizing objects with variable shapes. When ASM is extended to multiview cases, the parameter estimation approaches in previous works ...
RECOMB
2001
Springer
15 years 10 months ago
2001
Springer
The Smith-Waterman algorithm for local sequence alignment is one of the most important techniques in computational molecular biology. This ingenious dynamic programming approach w...
DAWAK
1999
Springer
15 years 1 months ago
1999
Springer
A data warehouse DW can be seen as a set of materialized views de ned over remote base relations. When a query is posed, it is evaluated locally, using the materialized views, wi...