3143 search results - page 283 / 629 » Minimization of entropy functionals |
144
click to vote
INFOCOM
1999
IEEE
15 years 9 months ago
1999
IEEE
We consider how to allocate bandwidth in a multicast tree so as to optimize some global measure of performance. In our model each receiver has a budget to be used for bandwidth res...
120
Voted
EPIA
1999
Springer
15 years 9 months ago
1999
Springer
We present two models of hierarchical structured multi-agents, and we describe how to obtain a modal knowledge base from distributed sources. We then propose a computationally orie...
119
click to vote
ICALP
1998
Springer
15 years 9 months ago
1998
Springer
It is well known that the performance of quicksort can be improved by selecting the median of a sample of elements as the pivot of each partitioning stage. For large samples the pa...
161
click to vote
CAAN
2007
Springer
15 years 8 months ago
2007
Springer
We consider the problem of scheduling on parallel uniformly related machines, where preemptions are allowed and the machines are controlled by selfish agents. Our goal is to minimi...
127
Voted
CRYPTO
2007
Springer
15 years 8 months ago
2007
Springer
Oblivious transfer (OT) is an essential building block for secure multiparty computation when there is no honest majority. In this setting, current protocols for n 3 parties requ...