1953 search results - page 219 / 391 » Embedded Probabilistic Programming |
112
click to vote
ICALP
1995
Springer
15 years 6 months ago
1995
Springer
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilistic class ZPP(NP). As a consequence we get a deeper collapse of the polynomial-...
188
Voted
WSC
2004
15 years 3 months ago
2004
Decision trees are one of the most easy to use tools in decision analysis. Problems where decision tree branches are based on random variables have not received much attention. Th...
128
click to vote
IOR
2007
15 years 2 months ago
2007
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...
141
click to vote
LICS
2010
IEEE
15 years 27 days ago
2010
IEEE
—We provide a syntactic analysis of contextual preorder and equivalence for a polymorphic programming language with effects. Our approach applies uniformly across a range of alge...
134
click to vote
TRANSCI
2010
14 years 9 months ago
2010
We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with time windows in which customers appear probabilistically and their service times are uncert...