14165 search results - page 409 / 2833 » The generalized two-server problem |
173
click to vote
CTRSA
2008
Springer
15 years 8 months ago
2008
Springer
We motivate and describe the problem of finding protocols for multiparty computations that only use a single broadcast round per computation (latency-free computations). We show t...
130
click to vote
ESANN
2007
15 years 8 months ago
2007
In this paper, we address the problem of deriving bounds for the moments of nearest neighbor distributions. The bounds are formulated for the general case and specifically applied...
180
click to vote
WCE
2007
15 years 8 months ago
2007
—A new method for minimization problem over simplex, as a generalization of a well-known in onedimensional optimization bisection method is proposed. The convergence of the metho...
167
click to vote
MP
2006
15 years 6 months ago
2006
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...
179
click to vote
FGCS
2000
15 years 6 months ago
2000
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...