Results 41 to 50 of about 995,420 (316)
Sustainability Green Raw Material Inventory with Continuous Replenishment Method: A Case Study Housing Construction Company [PDF]
The company is engaged in housing construction. Every year their production increase using green materials, from 2018 to 2021. This growth emerges problems such as overstock and dead stock.
Wijaya Dendhy Indra +2 more
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peilin Zhao +3 more
openaire +2 more sources
Kernel-based algorithms such as support vector machines have achieved considerable success in various problems in batch setting, where all of the training data is available in advance. Support vector machines combine the so-called kernel trick with the large margin idea.
Kivinen, Jyrki +2 more
openaire +3 more sources
We initiate a study of computable online (c-online) learning, which we analyze under varying requirements for "optimality" in terms of the mistake bound. Our main contribution is to give a necessary and sufficient condition for optimal c-online learning and show that the Littlestone dimension no longer characterizes the optimal mistake bound of c ...
Niki Hasrati, Shai Ben-David
openaire +3 more sources
Background: Given the digital transformation in currently emerging digital era in Financial Service Industry; marked by the rise of Fintech; Financial Service Authority (FSA) is challenged to mitigate new type of risks that are introduced by it. As first
Dina Fitria Murad +4 more
doaj +1 more source
This study aims to formulate a business development strategy that is appropriate and can be applied to the traditional Indonesian health drink business "Telang Limao Bangkak" which is a combination of Bunga Telang and Limao Calong Bangka (Orange Key ...
Muhammad Alfarizi, Rini Kurnia Sari
doaj +1 more source
We study a type of Online Linear Programming (OLP) problem that maximizes the objective function with stochastic inputs. The performance of various algorithms that analyze this type of OLP is well studied when the stochastic inputs follow some i.i.d distribution.
openaire +2 more sources
We introduce online learning algorithms which are independent of feature scales, proving regret bounds dependent on the ratio of scales existent in the data rather than the absolute scale. This has several useful effects: there is no need to pre-normalize data, the test-time and test-space complexity are reduced, and the algorithms are more robust.
Stéphane Ross +2 more
openaire +4 more sources
We propose a general framework for studying adaptive regret bounds in the online learning framework, including model selection bounds and data-dependent bounds. Given a data- or model-dependent bound we ask, "Does there exist some algorithm achieving this bound?" We show that modifications to recently introduced sequential complexity measures can be ...
Dylan J. Foster +2 more
openaire +3 more sources
This study aims to examine the effect of private hospital logistics factors on treatment satisfaction and specialist patient satisfaction. This study has five construction dimensions of hospital logistics, namely physical accessibility, waiting time ...
Muhammad Alfarizi, Ngatindriatun
doaj +1 more source

