759 search results - page 46 / 152 » Optimal Graph Search with Iterated Graph Cuts |
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
182
click to vote
ICDE
2003
IEEE
15 years 11 months ago
2003
IEEE
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
CVPR
2010
IEEE
15 years 2 months ago
2010
IEEE
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Superpixels are used as both regions of support for featur...
AIPS
2010
15 years 1 days ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...