Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Tarim, Armagan"'
Stochastic Constraint Programming (SCP) is an extension of Constraint Programming (CP) used for modelling and solving problems involving constraints and uncertainty. SCP inherits excellent modelling abilities and filtering algorithms from CP, but so
Externí odkaz:
http://arxiv.org/abs/1704.07183
We introduce the BIN_COUNTS constraint, which deals with the problem of counting the number of decision variables in a set which are assigned values that lie in given bins. We illustrate a decomposition and a filtering algorithm that achieves general
Externí odkaz:
http://arxiv.org/abs/1611.08942
Publikováno v:
International Journal of Forecasting, Elsevier, Vol. 37(2): 708-715, 2021
Only two Croston-style forecasting methods are currently known for handling stochastic intermittent demand with possible demand obsolescence: TSB and HES, both shown to be unbiased. When an item becomes obsolescent then TSB's forecasts decay exponent
Externí odkaz:
http://arxiv.org/abs/1409.1609
Publikováno v:
IJCAI 2003: 257-262
To model combinatorial decision problems involving uncertainty and probability, we extend the stochastic constraint programming framework proposed in [Walsh, 2002] along a number of important dimensions (e.g. to multiple chance constraints and to a r
Externí odkaz:
http://arxiv.org/abs/0905.3763
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Visentin, A, Prestwich, S, Rossi, R & Tarim, A 2019, Modelling dynamic programming-based global constraints in constraint programming . in H A L Thi, H M Le & T P Dinh (eds), Optimization of Complex Systems : Theory, Models, Algorithms and Applications . Advances in Intelligent Systems and Computing, vol. 991, pp. 417-427, 6th World Congress on Global Optimization, Metz, France, 8/07/19 . https://doi.org/10.1007/978-3-030-21803-4_42
Dynamic Programming (DP) can solve many complex problems in polynomial or pseudo-polynomial time, and it is widely used in Constraint Programming (CP) to implement powerful global constraints. Implementing such constraints is a nontrivial task beyond
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3094::d9b741d3bfc8ab2423a9a5cbf9c6240c
https://www.pure.ed.ac.uk/ws/files/94239545/Visentin_et_al_WCGO_2019.pdf
https://www.pure.ed.ac.uk/ws/files/94239545/Visentin_et_al_WCGO_2019.pdf
Publikováno v:
Prestwich, S, Tarim, A & Rossi, R 2016, Constraint problem specification as compression . in Proceedings of the 2nd Global Conference on Artificial Intelligence ., 41, EPiC Series in Computing, pp. 280-292 .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3094::240abee00cd8308a11a5d4ebbaab4715
https://www.pure.ed.ac.uk/ws/files/26822772/kolmogorov.pdf
https://www.pure.ed.ac.uk/ws/files/26822772/kolmogorov.pdf
Autor:
Tarim, Armagan, Karan, Mehmet Baha
Publikováno v:
International Journal of Government Auditing. Oct2001, Vol. 28 Issue 4, p12. 3p.
