In this article, we introduce a new notion of generalized convex fuzzy mapping known as strongly preinvex on the invex set. Firstly, have investigated some properties mapping. particular, establish equivalence among mapping, and monotonicity. We also prove that optimality conditions for sum G-differentiable mappings non-G-differentiable can be characterized by mixed variational-like inequalitie...

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...

Necessary conditions of optimality in the form of an unmaximized Inclusion (UI) are derived for optimal control problems with state constraints. The conditions presented here generalize earlier optimality conditions to problems that may be nonconvex. The derivation of UI type conditions in the absence of the convexity assumption is of particular importance when deriving necessary conditions for...

Let G = (V,E) be an m1 × . . . ×mk grid. Assuming that each v ∈ V is occupied by a robot and a robot may move to a neighboring vertex in a step via synchronized rotations along cycles of G, we first establish that the arbitrary reconfiguration of labeled robots on G can be performed in O(k ∑ i mi) makespan and requires O(|V |) running time in the worst case and o(|V |) when G is non-degenerate ...

In “A Restless Bandit Model for Resource Allocation, Competition and Reservation,” J. Fu, B. Moran, P. G. Taylor study a resource allocation problem with varying requests resources of limited capacity shared by multiple requests. This is modeled as set heterogeneous restless multi-armed bandit problems (RMABPs) connected constraints imposed capacity. Following Whittle’s idea relaxing the Weber ...

In the common nonparametric regression model yi g ti ti i i n with i i d noise and nonrepeatable design points ti we consider the problem of choosing an optimal design for the estimation of the regression function g A minimax approach is adopted which searches for designs minimizing the maximum of the asymptotic integrated mean squared error where the maximum is taken over an appropriately boun...