223 search results - page 26 / 45 » Approximate local search in combinatorial optimization |
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Most algorithms for real-time tracking of deformable shapes provide sub-optimal solutions for a suitable energy minimization task: The search space is typically considered too lar...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
DATESO
2007
14 years 11 months ago
2007
When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...
EVOW
2003
Springer
15 years 2 months 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...
COR
2010
14 years 9 months ago
2010
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...