1933 search results - page 223 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
118
click to vote
TIT
2010
14 years 10 months ago
2010
The joint-sparse recovery problem aims to recover, from sets of compressed measurements, unknown sparse matrices with nonzero entries restricted to a subset of rows. This is an ex...
156
click to vote
ICTAI
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
127
click to vote
ICRA
2009
IEEE
15 years 10 months ago
2009
IEEE
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...
157
Voted
LCPC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. A fundamental problem in the analysis of parallel programs is to determine when two statements in a program may run concurrently. This analysis is the parallel analog to ...
120
click to vote
VLDB
1997
ACM
15 years 8 months ago
1997
ACM
Information integration systems have to cope with the different and limited query interfaces of the underlying information sources. First, the integration systems need description...