2168 search results - page 35 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
AAAI
2006
13 years 9 months ago
2006
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
JACM
1998
13 years 7 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
AUTOMATICA
2006
13 years 7 months ago
2006
In this paper, the complex-step method is applied in the setting of numerical optimisation problems involving dynamical systems modelled as nonlinear differential equations. The m...
SIGCOMM
2006
ACM
14 years 1 months ago
2006
ACM
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...