2108 search results - page 225 / 422 » Constrained Heuristic Search |
182
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
202
click to vote
ISDA
2008
IEEE
16 years 26 days ago
2008
IEEE
Due to their excellent performance in solving combinatorial optimization problems, metaheuristics algorithms such as Genetic Algorithms (GA), Simulated Annealing (SA) and Tabu Sea...
169
click to vote
CP
2005
Springer
16 years 13 hour ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
152
click to vote
EOR
2008
15 years 6 months ago
2008
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...
193
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...