2108 search results - page 104 / 422 » Constrained Heuristic Search |
113
click to vote
IJAMCIGI
2010
14 years 11 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...
121
click to vote
GECCO
2006
Springer
15 years 5 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...
117
click to vote
AIPS
2011
14 years 5 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...
87
Voted
PIMRC
2008
IEEE
15 years 8 months ago
2008
IEEE
— In the opportunistic power control algorithm (OPC), designed in [1], [2], each user tries to keep the product of its transmit power and its experienced effective interference t...
114
click to vote
ICCAD
2001
IEEE
15 years 10 months 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 ...