882 search results - page 104 / 177 » On the Hardness of Graph Isomorphism |
167
click to vote
MICCAI
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. This paper describes a new segmentation technique for multidimensional dynamic data. One example of such data is a perfusion sequence where a number of 3D MRI volumes sho...
202
click to vote
TAOSD
2010
15 years 4 months ago
2010
Abstract. Aspect Oriented Modeling (AOM) techniques facilitate separate modeling of concerns and allow for a more flexible composition of these than traditional modeling technique...
233
click to vote
SOICT
2010
15 years 18 days ago
2010
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
169
Voted
AIPS
2011
14 years 9 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...
163
click to vote
JAIR
2011
2011
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
14 years 8 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 ...