5606 search results - page 516 / 1122 » Randomization Techniques for Graphs. |
184
click to vote
AIPS
2011
14 years 10 months ago
2011
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work (Hoffmann 2005), it was observed that the optimal relax...
189
click to vote
JAIR
2011
2011
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
14 years 9 months ago
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work, it was observed that the optimal relaxation heuristic ...
162
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
171
click to vote
IJCAI
2007
15 years 8 months ago
2007
Effective representation of Web search results remains an open problem in the Information Retrieval community. For ambiguous queries, a traditional approach is to organize search ...
206
click to vote
BMCBI
2008
15 years 7 months ago
2008
Background: Recent discoveries of a large variety of important roles for non-coding RNAs (ncRNAs) have been reported by numerous researchers. In order to analyze ncRNAs by kernel ...