2089 search results - page 153 / 418 » A New Problem in String Searching |
137
click to vote
EVOW
2008
Springer
15 years 4 months ago
2008
Springer
Advances in modern technologies for measuring protein-protein interaction (PPI) has boosted research in PPI networks analysis and comparison. One of the challenging problems in com...
136
click to vote
AIPS
2006
15 years 4 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
120
click to vote
TROB
2010
15 years 1 months ago
2010
—To efficiently solve challenging motion-planning problems with dynamics, this paper proposes treating motion planning not just as a search problem in a continuous space but as ...
118
click to vote
CP
2006
Springer
15 years 6 months ago
2006
Springer
The problem of finding a graceful labelling of a graph, or proving that the graph is not graceful, has previously been modelled as a CSP. A new and much faster CSP model of the pro...
111
Voted
AIPS
2007
15 years 5 months ago
2007
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...