Rank aggregation is an important task in many areas, nevertheless, none of rank aggregation algorithms is best for all cases. The main goal of this work is to develop a method, which for a given rank list finds the best rank aggregation algorithm with respect to a certain optimality criterion. Two approaches based on meta-feature description are proposed and one of them shows promising results.

Robotic coverage is the problem of moving a sensor or actuator over all points in a given region. Ultimately, we want a coverage path that minimizes some cost such as time. We take the approach of decomposing the coverage region into subregions, selecting a sequence of those subregions, and then generating a path that covers each subregion in turn. In this paper, we focus on generating decompos...

\Ve show thaI, H.daptive n�al time dyrmmic prograrnming ex­ tended with the action selection strategy which chooses the best action Recording 1.0 the laLest, estimaLe orLhf' cos!' rllndiofl yields i-\..'i.yrnptoLicl-tlly 0pLirnal poli(:ies within riniLe Limp lJnder· !,lIP minimax 0pLirnality criu-'­ rian. H'om this it follows that learning and exploitation do not confiict under this special opt...

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv DEDICATION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . v ACKNOWLEDGEMENT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vi 1.0 INTRODUCTION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2.0 ENDOGENOUS FORMATION OF A BIDDING RING . . . . . . . . . 3 ...

This paper describes a game-theoretic methodology to design and embed watermarks in images. The optimality criterion is probability of error of the decoder. Analytical solutions are presented for problems involving Gaussian host images and illustrated with examples. Significant improvements over previous designs are obtained.

We consider component allocation in Assemble-to-Order production–inventory systems. We prove that asymptotic optimality on the diffusion scale can be achieved under a continuous-review policy. We also show that in many systems, meeting this optimality criterion requires component reservation.

in this paper we study optimization problems with infinite many inequality constraints on a banach space where the objective function and the binding constraints are locally lipschitz‎. ‎necessary optimality conditions and regularity conditions are given‎. ‎our approach are based on the michel-penot subdifferential.