196 search results - page 9 / 40 » A finite set of functions with an EXPTIME-complete compositi... |
JGO
2008
14 years 11 months ago
2008
This article complements the paper [7], where we showed that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a leve...
125
Voted
WSC
2004
15 years 1 months ago
2004
We consider the problem of estimating the small probability that a function of a finite number of random variables exceeds a large threshold. Each input random variable may be lig...
CHARME
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. I develop a compositional theory of refinement for the branching time framework based on stuttering simulation and prove that if one system refines another, then a refine...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We consider a generalization of stochastic bandit problems where the set of arms, X, is allowed to be a generic topological space. We constraint the mean-payoff function with a di...
110
Voted
ICSOFT
2008
15 years 1 months ago
2008
Abstract. Since the Internet has become a commodity in both wired and wireless environments, new applications and paradigms have emerged to explore this highly distributed and wide...