1614 search results - page 76 / 323 » Breadth-First Heuristic Search |
133
Voted
IJAMCIGI
2010
15 years 1 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...
142
click to vote
GECCO
2006
Springer
15 years 7 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...
141
click to vote
AIPS
2011
14 years 7 months ago
2011
Conformant planning can be formulated as a path-finding problem in belief space where the two main challenges are the heuristics to guide the search, and the representation and u...
137
click to vote
ICCAD
2001
IEEE
16 years 27 days ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
117
click to vote
IIWAS
2008
15 years 5 months ago
2008
The main text content of an HTML document on the WWW is typically surrounded by additional contents, such as navigation menus, advertisements, link lists or design elements. Conte...