980 search results - page 6 / 196 » Faster Possibility Detection by Combining Two Approaches |
AAAI
2008
13 years 9 months ago
2008
Agents often have to construct plans that obey resource limits for continuous resources whose consumption can only be characterized by probability distributions. While Markov Deci...
ICC
2008
IEEE
14 years 1 months ago
2008
IEEE
—Dynamic spectrum access (DSA) is a promising approach for mitigating spectrum scarcity. Underlying DSA is the need for fast and reliable spectrum sensing over a potentially larg...
BMCBI
2011
12 years 11 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
ICALP
2005
Springer
14 years 28 days ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
ECCC
2011
13 years 2 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...