952 search results - page 84 / 191 » Computational complexity of stochastic programming problems |
129
click to vote
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
126
Voted
IUI
2009
ACM
15 years 11 months ago
2009
ACM
Selection tasks are common in modern computer interfaces: we are often required to select a set of files, emails, data entries, and the like. File and data browsers have sorting a...
136
Voted
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
134
Voted
UAI
2004
15 years 4 months ago
2004
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
122
click to vote
ICDCS
1996
IEEE
15 years 6 months ago
1996
IEEE
We introduce a shared memory software prototype system for executing programs with nested parallelism on a network of workstations. This programming model exhibits a very convenie...