415 search results - page 49 / 83 » Optimal query complexity bounds for finding graphs |
154
click to vote
AIPS
2006
15 years 4 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
145
click to vote
TCS
2008
15 years 3 months ago
2008
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
115
click to vote
TCS
2010
14 years 10 months ago
2010
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
123
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
110
Voted
ESOP
2001
Springer
15 years 7 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...