699 search results - page 58 / 140 » The method of combinatorial telescoping |
120
Voted
GECCO
2010
Springer
15 years 5 months ago
2010
Springer
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...
127
Voted
TCS
2008
15 years 3 months ago
2008
We address the problem of detecting consensus motifs, that occur with subtle variations, across multiple sequences. These are usually functional domains in DNA sequences such as t...
137
click to vote
HEURISTICS
2002
15 years 3 months ago
2002
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
152
Voted
PE
2011
Springer
14 years 10 months ago
2011
Springer
Performance and dependability evaluation of complex systems by means of dynamic stochastic models (e.g. Markov chains) may be impaired by the combinatorial explosion of their stat...
135
Voted
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
In this paper we propose a general framework to solve the articulated shape matching problem, formulated as finding point-to-point correspondences between two shapes represented b...