Branching bandits and Klimov's problem : achievable region and side constraints

Get full text

Greek short stories in the last quarter of the twentieth century by Natsina, A

“…To this goal more than a hundred short stories are examined, by Sotiris Dimitriou, Michel Fais, Rhea Galanaki, E. Ch. Gonatas, Yiorgos loannou, Christophoros Milionis, Dimitris Nollas, I. …”

Relaxation methods for minimum cost network flow problems

Get full text

Distributed asynchronous deterministic and stochastic gradient optimization algorithms

Get full text

Notes on optimal routing and flow control for communication networks

Get full text

Two-metric projection methods for constrained optimization

Get full text

A unified framework for primal-dual methods in minimum cost network flow problems

Get full text

Asymptotic optimality of shortest path routing

Get full text

RELAX: a computer code for minimum cost network flow problems

Get full text

Adaptive aggregation methods for infinite horizon dynamic programming

Get full text

The auction algorithm for assignment and other network flow problems

Get full text

Forward path search : a new dual coordinate ascent algorithm for shortest paths

Get full text

An auction algorithm for shortest paths

Get full text

Dynamic broadcasting in parallel computing

Get full text

A conflict sense routing protocol and its performance for hypercubes

Get full text

Transposition of banded matrices in hypercubes : a "nearly isotropic" task

Get full text

Mathematical equivalence of the auction algorithm for assignment and the e-relaxation (preflow-push) method for min cost flow

Get full text

Performance of hypercube routing schemes with or without buffering

Get full text

RELAX-IV : a faster version of the RELAX code for solving minimum cost flow problems

Get full text

An e-relaxation method for separable convex cost network flow problems

Get full text