1258 search results - page 119 / 252 » Architecture-driven Problem Decomposition |
COCO
2010
Springer
14 years 29 days ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
AIPS
2000
13 years 10 months ago
2000
We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by prop...
AIPS
2011
13 years 20 days ago
2011
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...
CVPR
2004
IEEE
14 years 11 months ago
2004
IEEE
When we take a picture through a window the image we obtain is often a linear superposition of two images: the image of the scene beyond the window plus the image of the scene ref...
CVPR
2008
IEEE
14 years 11 months ago
2008
IEEE
This paper examines the problem of extracting lowdimensional manifold structure given millions of highdimensional face images. Specifically, we address the computational challenge...