4843 search results - page 283 / 969 » The Shortcut Problem - Complexity and Approximation |
163
click to vote
PE
1998
Springer
15 years 3 months ago
1998
Springer
Asymptotic approximations are constructed for the performance measures of product form queueing networks consisting of single server, fixed rate nodes with large populations. The...
150
click to vote
AAAI
2006
15 years 5 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...
130
click to vote
SODA
2000
ACM
15 years 5 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
153
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
151
click to vote
ESWS
2009
Springer
15 years 10 months ago
2009
Springer
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...