94 search results - page 9 / 19 » Generation of Tree Decompositions by Iterated Local Search |
HUMO
2007
Springer
13 years 11 months ago
2007
Springer
We propose a method to find candidate 2D articulated model configurations by searching for locally optimal configurations under a weak but computationally manageable fitness functi...
HM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper introduces a new algorithm, based on the concept of ejection chains, to effectively target vehicle routing problems with time window constraints (VRPTW). Ejec...
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents an extension to genetic programming to allow the evolution of programs containing local variables with static scope which obey the invariant that all variables...
EVOW
2003
Springer
14 years 26 days ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...