3341 search results - page 247 / 669 » On Bounded Queries and Approximation |
195
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
246
click to vote
SAGA
2009
Springer
16 years 1 months ago
2009
Springer
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
182
click to vote
ATAL
2005
Springer
16 years 6 days ago
2005
Springer
Agents or agent teams deployed to assist humans often face the challenges of monitoring the state of key processes in their environment (including the state of their human users t...
188
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
194
click to vote
CAV
2006
Springer
15 years 10 months ago
2006
Springer
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...