246 search results - page 5 / 50 » Dynamic Local Search for the Maximum Clique Problem |
EOR
2007
14 years 9 months ago
2007
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environm...
ALGORITHMICA
2010
14 years 9 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
IPSN
2003
Springer
15 years 2 months ago
2003
Springer
In this paper we study a dynamic sensor selection method for Bayesian filtering problems. In particular we consider the distributed Bayesian Filtering strategy given in [1] and sh...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Application-specific, parameterized local search algorithms (PLSAs), in which optimization accuracy can be traded off with runtime, arise naturally in many optimization contexts....
ICPR
2000
IEEE
15 years 10 months ago
2000
IEEE
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...