|
|
|
|
|
Antoine Genitrini and Martin Pépin
In the context of combinatorial sampling, the so-called ?unranking method? can be seen as a link between a total order over the objects and an effective way to construct an object of given rank. The most classical order used in this context is the lexico...
ver más
|
|
|
|
|
|
|
|
|
Tiago Fazeres-Ferradosa, João Chambel, Francisco Taveira-Pinto, Paulo Rosa-Santos, Francisco V. C. Taveira-Pinto, Gianmaria Giannini and Piet Haerens
The offshore wind is the sector of marine renewable energy with the highest commercial development at present. The margin to optimise offshore wind foundations is considerable, thus attracting both the scientific and the industrial community. Due to the ...
ver más
|
|
|
|
|
|
|
|
|
Bo Zhao, Zhihong Chen, Hai Lin and XiangMin Ji
The write-only oblivious RAM (ORAM) is proposed to efficiently protect the privacy of applications such as cloud storage synchronization and encrypted hidden volumes. For N blocks with size B = ?(log2N), the most efficient write-only ORAM, DetWoORAM, ach...
ver más
|
|
|
|
|
|
|
|
|
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci and Eli Upfal
We present an algorithm for approximating the diameter of massive weighted undirected graphs on distributed platforms supporting a MapReduce-like abstraction. In order to be efficient in terms of both time and space, our algorithm is based on a decomposi...
ver más
|
|
|
|
|
|
|
|
|
Elias Munapo
Pág. 59 - 69
The paper presents a new reformulation approach to reduce the complexity of a branch and bound algorithm for solving the knapsack linear integer problem. The branch and bound algorithm in general relies on the usual strategy of first relaxing the integer...
ver más
|
|
|
|