1632 search results - page 275 / 327 » Sublinear Time Algorithms for Metric Space Problems |
144
Voted
AIPS
2006
15 years 5 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 ...
143
Voted
SIGMOD
2003
ACM
16 years 3 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
126
Voted
AAAI
1996
15 years 4 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
154
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
155
click to vote
SIAMSC
2008
15 years 3 months ago
2008
In systems biology, the stochastic description of biochemical reaction kinetics is increasingly being employed to model gene regulatory networks and signalling pathways. Mathematic...