Sciweavers

28888 search results - page 5614 / 5778
» Computability and complexity in analysis
Sort
View
CORR
2008
Springer
132views Education» more  CORR 2008»
15 years 3 months ago
Dynamic Rate Allocation in Fading Multiple-access Channels
We consider the problem of rate allocation in a fading Gaussian multiple-access channel (MAC) with fixed transmission powers. Our goal is to maximize a general concave utility func...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
125
Voted
DC
2010
15 years 3 months ago
Refined quorum systems
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
Rachid Guerraoui, Marko Vukolic
EOR
2010
93views more  EOR 2010»
15 years 3 months ago
Two-stage flexible-choice problems under uncertainty
A significant input-data uncertainty is often present in practical situations. One approach to coping with this uncertainty is to describe the uncertainty with scenarios. A scenar...
Jurij Mihelic, Amine Mahjoub, Christophe Rapine, B...
AOR
2006
95views more  AOR 2006»
15 years 3 months ago
A New Practically Efficient Interior Point Method for LP
In this paper we briefly review the importance of LP (linear programming), and Dantzig's main contributions to OR (Operations Research), mathematics, and computer science. In...
Katta G. Murty
EOR
2008
106views more  EOR 2008»
15 years 3 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
« Prev « First page 5614 / 5778 Last » Next »