2108 search results - page 53 / 422 » Constrained Heuristic Search |
97
Voted
CEC
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract— Meta-heuristic optimization approaches are commonly applied to many discrete optimization problems. Many of these optimization approaches are based on a local search op...
117
click to vote
FLAIRS
2008
15 years 4 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
102
click to vote
CP
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We devise a theoretical model for dichotomic search algorithms for constrained optimization. We show that, within our model, a certain way of choosing the breaking point ...
139
click to vote
AAECC
2009
Springer
15 years 8 months ago
2009
Springer
A new reduction on the size of the search space for cocyclic Hadamard matrices over dihedral groups D4t is described, in terms of the so called central distribution. This new searc...
CPAIOR
2010
Springer
15 years 6 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...