Results 31 to 40 of about 357 (209)

Submodular Secretary Problem with Shortlists

open access: yesCoRR, 2018
In submodular $k$-secretary problem, the goal is to select $k$ items in a randomly ordered input so as to maximize the expected value of a given monotone submodular function on the set of selected items. In this paper, we introduce a relaxation of this problem, which we refer to as submodular $k$-secretary problem with shortlists.
Agrawal, Shipra   +2 more
openaire   +4 more sources

Frontal EEG Asymmetry and Attachment Style During Sequential Decision-Making in the Secretary Problem

open access: yesBehavioral Sciences
Sequential decisions often unfold under uncertainty, requiring people to evaluate options one at a time and commit without the possibility of returning to earlier choices.
Ilan Laufer
doaj   +1 more source

Learning in the Repeated Secretary Problem [PDF]

open access: yesProceedings of the 2017 ACM Conference on Economics and Computation, 2017
In the classical secretary problem, one attempts to find the maximum of an unknown and unlearnable distribution through sequential search. In many real-world searches, however, distributions are not entirely unknown and can be learned through experience.
Daniel G. Goldstein   +3 more
openaire   +2 more sources

Optimal Stopping Theory-Based Online Node Selection in IoT Networks for Multi-Parameter Federated Learning

open access: yesIEEE Transactions on Machine Learning in Communications and Networking
Federated Learning (FL) has attracted the interest of researchers since it hinders inefficient resource utilization by developing a global learning model based on local model parameters (LMP).
Seda Dogan-Tusha   +2 more
doaj   +1 more source

General “Maize” as One of the Failed Managerial Experiments of N. S. Khrushchev

open access: yesУправленческое консультирование, 2022
Goals. Based on the analysis of materials from the Soviet press, scientific publications and a number of other sources, to show the hyperactive activity of the First Secretary of the CPSU Central Committee N.S.
A. I. Lushin
doaj   +1 more source

On a Class of Secretary Problems

open access: yesThe Annals of Probability, 1973
Asymptotic forms for the optimal expected payoffs (minimal costs) for a generalized class of "Secretary" problems are investigated by an analysis of a related family of differential equations. A class of unbounded payoff functions with bounded expected payoffs is determined and methods for generating the expected payoffs are developed.
openaire   +2 more sources

Multiphoton Quantum Reservoirs For Robust Multidimensional Computing

open access: yesAdvanced Science, EarlyView.
Projective measurements reveal hidden multidimensional quantum networks within classical multiphoton fields, enabling robust quantum reservoirs for room‐temperature quantum simulation, prediction, and information processing. These networks transform noisy classical photonic platforms into scalable quantum computational architectures.
Mingyuan Hong   +10 more
wiley   +1 more source

Efficient Modeling of Interest Forwarding in Information Centric Vehicular Networks

open access: yesIEEE Open Journal of Vehicular Technology
Vehicular networks (V-Nets) of the current era is widely used for information sharing and entertainment. Considering the popularity and demand for faster data communications, V-Nets are evolving towards an information-centric approach, namely the ...
Surya Samantha Beri, Nitul Dutta
doaj   +1 more source

PKM PENINGKATAN KOMPETENSI SISWA SMK ABDI NEGARA MELALUI PELATIHAN MACRO UNTUK PEMBUATAN APLIKASI AKUNTANSI SEDERHANA

open access: yesAbdimas Altruis, 2020
PKM For SMK Abdi Negara 2 Cibarusah with Accounting and Office Administration Majoring is done to solve the problem faced by them. As a prospective graduate who will have a considerable opportunity to become an admin and secretary for a company, the ...
R.S. Samosir, M. Rusli, Erwin Syahrani
doaj   +1 more source

The Secretary Problem with Predictions

open access: yesMathematics of Operations Research
The value maximization version of the secretary problem is the problem of hiring a candidate with the largest value from a randomly ordered sequence of candidates. In this work, we consider a setting where predictions of candidate values are provided in advance.
Kaito Fujii, Yuichi Yoshida
openaire   +2 more sources

Home - About - Disclaimer - Privacy