1529 search results - page 12 / 306 » Search Space Analysis of the Linear Ordering Problem |
119
Voted
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
The hurdles in solving Constrained Optimization Problems (COP) arise from the challenge of searching a huge variable space in order to locate feasible points with acceptable solut...
127
Voted
AAAI
2007
15 years 5 months ago
2007
In a constraint optimization problem (COP), many feasible valuations lead to the same objective value. This often means a huge search space and poor performance in the propagation...
124
Voted
SIAMCO
2000
15 years 3 months ago
2000
We study the asymptotic behavior at infinity of solutions of a second order evolution equation with linear damping and convex potential. The differential system is defined in a rea...
144
Voted
AAAI
2008
15 years 5 months ago
2008
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
125
Voted
IBERAMIA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...