2108 search results - page 122 / 422 » Constrained Heuristic Search |
126
click to vote
SBP
2011
Springer
14 years 8 months ago
2011
Springer
Given a network, we are interested in ranking sets of nodes that score highest on user-specified criteria. For instance in graphs from bibliographic data (e.g. PubMed), we would l...
ICCAD
2003
IEEE
15 years 10 months ago
2003
IEEE
Heuristics are widely used for solving computational intractable synthesis problems. However, until now, there has been limited effort to systematically develop heuristics that ca...
ECAI
2000
Springer
15 years 6 months ago
2000
Springer
Case-based reasoning (CBR) aims at using experience from the past in order to guide future problem solving rather than “starting from scratch” every time. We propose a CBR stra...
108
click to vote
KI
2001
Springer
15 years 6 months ago
2001
Springer
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...
96
Voted
IJCAI
1997
15 years 3 months ago
1997
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...