Sciweavers

1529 search results - page 12 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
GECCO
2008
Springer
108views Optimization» more  GECCO 2008»
13 years 8 months ago
Search space reduction technique for constrained optimization with tiny feasible space
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...
Abu S. S. M. Barkat Ullah, Ruhul A. Sarker, David ...
AAAI
2007
13 years 10 months ago
Search Space Reduction and Russian Doll Search
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...
Kenil C. K. Cheng, Roland H. C. Yap
SIAMCO
2000
110views more  SIAMCO 2000»
13 years 7 months ago
On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces
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...
Felipe Alvarez
AAAI
2008
13 years 10 months ago
Limits and Possibilities of BDDs in State Space Search
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
Stefan Edelkamp, Peter Kissmann
IBERAMIA
2004
Springer
14 years 28 days ago
Constrainedness and Redundancy by Constraint Ordering
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...
Miguel A. Salido, Federico Barber