841 search results - page 47 / 169 » Approximability of Minimum AND-Circuits |
APPROX
2008
Springer
14 years 2 days ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
EOR
2007
13 years 10 months ago
2007
A simultaneous perturbation stochastic approximation (SPSA) method has been developed in this paper, using the operators of perturbation with the Lipschitz density function. This ...
DSN
2011
IEEE
12 years 9 months ago
2011
IEEE
—In this paper we extend the class of MAP queueing networks to include blocking models, which are useful to describe the performance of service instances which have a limited con...
SODA
2012
ACM
12 years 15 days ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
NIPS
2001
13 years 11 months ago
2001
In this paper we will show that a restricted class of constrained minimum divergence problems, named generalized inference problems, can be solved by approximating the KL divergen...