Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Velibor V. Mišić"'
Publikováno v:
The Astronomical Journal, Vol 167, Iss 3, p 122 (2024)
Precise Doppler studies of extrasolar planets require fine-grained control of observational cadence, i.e., the timing of and spacing between observations. We present a novel framework for scheduling a set of Doppler campaigns with different cadence r
Externí odkaz:
https://doaj.org/article/b5a987419e1343b69f57574bc4392a2a
Publikováno v:
npj Digital Medicine, Vol 4, Iss 1, Pp 1-11 (2021)
Abstract The interest in applying machine learning in healthcare has grown rapidly in recent years. Most predictive algorithms requiring pathway implementations are evaluated using metrics focused on predictive performance, such as the c statistic. H
Externí odkaz:
https://doaj.org/article/ff0032ece6414e12b6d1579726ea9ab3
Publikováno v:
The Astronomical Journal, Vol 167, Iss 1, p 33 (2023)
The size and complexity of modern astronomical surveys has grown to the point where, in many cases, traditional human scheduling of observations are tedious at best and impractical at worst. Automated scheduling algorithms present an opportunity to s
Externí odkaz:
https://doaj.org/article/f65f4b2e563c4cf5ab889d31a774775c
Autor:
Velibor V. Mišić
Publikováno v:
Operations Research. 68:1605-1624
Tree ensemble models such as random forests and boosted trees are among the most widely used and practically successful predictive models in applied machine learning and business analytics. Although such models have been used to make predictions base
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c301b1c39b48743ab00b22ea6d9d62f0
https://doi.org/10.1287/opre.2019.1928
https://doi.org/10.1287/opre.2019.1928
Autor:
Velibor V Mišić, Timothy C Y Chan
Publikováno v:
PLoS ONE, Vol 10, Iss 5, p e0125335 (2015)
We consider adaptive robust methods for lung cancer that are also dose-reactive, wherein the treatment is modified after each treatment session to account for the dose delivered in prior treatment sessions. Such methods are of interest because they p
Externí odkaz:
https://doaj.org/article/8c4ebe2fa3364229b70a7204b7f27b0e
Publikováno v:
Other repository
The U.S. Transportation Command (USTRANSCOM) is responsible for planning and executing the transportation of U.S. military personnel and cargo by air, land, and sea. The airlift planning problem faced by the air component of USTRANSCOM is to decide h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5169e7a33b151391efec50ddce275c58
https://doi.org/10.1287/trsc.2018.0847
https://doi.org/10.1287/trsc.2018.0847
Publikováno v:
NPJ Digital Medicine
npj Digital Medicine, Vol 4, Iss 1, Pp 1-11 (2021)
npj Digital Medicine, Vol 4, Iss 1, Pp 1-11 (2021)
The interest in applying machine learning in healthcare has grown rapidly in recent years. Most predictive algorithms requiring pathway implementations are evaluated using metrics focused on predictive performance, such as the c statistic. However, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::324953dd8bd52999d09729f4141d6266
https://doi.org/10.1038/s41746-021-00468-7
https://doi.org/10.1038/s41746-021-00468-7
Autor:
Yi-Chun Chen, Velibor V. Mišić
The decision forest model is a recently proposed nonparametric choice model that is capable of representing any discrete choice model and in particular, can be used to represent non-rational customer behavior. In this paper, we study the problem of f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::065bfa02743f4b36c48aaadcfd4564e0
http://arxiv.org/abs/2103.14067
http://arxiv.org/abs/2103.14067
Autor:
İrem Akçakuş, Velibor V. Mišić
The share-of-choice product design (SOCPD) problem is to find the product, as defined by its attributes, that maximizes market share arising from a collection of customer types or segments. When customers follow a logit model of choice, the market sh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ecdbc508d21f8f0296a8e2f810a6b193
Autor:
Velibor V. Mišić, Yi-Chun Chen
We propose a randomized method for solving linear programs with a large number of columns but a relatively small number of constraints. Since enumerating all the columns is usually unrealistic, such linear programs are commonly solved by column gener
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be795ed8d4d92132687897db419236e5
http://arxiv.org/abs/2007.10461
http://arxiv.org/abs/2007.10461