Sciweavers

113 search results - page 7 / 23
» On the expected value of the minimum assignment
Sort
View
JCP
2007
143views more  JCP 2007»
14 years 9 months ago
Alternatives for In-Service BER Estimation in All-Optical Networks: Towards Minimum Intrusion
— Combining the existing approaches for optical intelligence and the speed and capacity of light is undoubtedly the only viable strategy for building future-proof, highspeed netw...
Carolina Pinart
ESAW
2003
Springer
15 years 2 months ago
Competition, Cooperation, and Authorization
Abstract. Multi-agent systems considered in the paper consist of a finite number of agents, positions of which can be changed by system actions, and of an evaluation function whic...
Antoni W. Mazurkiewicz
STOC
1993
ACM
87views Algorithms» more  STOC 1993»
15 years 1 months ago
How to use expert advice
We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worst-case situations, i.e., we...
Nicolò Cesa-Bianchi, Yoav Freund, David P. ...
FSS
2002
84views more  FSS 2002»
14 years 9 months ago
A possibilistic approach to selecting portfolios with highest utility score
The mean-variance methodology for the portfolio selection problem, originally proposed by Markowitz, has been one of the most important research fields in modern finance. In this ...
Christer Carlsson, Robert Fullér, Pé...
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
14 years 11 months ago
On allocations that maximize fairness
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
Uriel Feige