1615 search results - page 73 / 323 » Pathology in heuristic search |
INFORMATICALT
2006
13 years 11 months ago
2006
Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization p...
AAAI
2000
14 years 16 days ago
2000
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
IJAMCIGI
2010
13 years 8 months ago
2010
Hyper-heuristics are identified as the methodologies that search the space generated by a finite set of low level heuristics for solving difficult problems. One of the iterative h...
JAIR
2000
13 years 11 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...