Zobrazeno 1 - 10
of 75
pro vyhledávání: '"H. L. Ong"'
Autor:
Kenneth Ka Hei Lai, Andrew K. T. Kuk, Alvin K. H. Au, Kenneth K. H. Wong, Ting Wang, Alan Tsang, Jacqueline H. T. Tai, Tiffany H. L. Ong, Simon T. C. Ko, Edwin Chan, Callie K. L. Ko
Publikováno v:
International Ophthalmology. 43:1811-1817
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3bf7c943cc9b21429e98eeddfd23b4ff
https://doi.org/10.1007/s10792-022-02578-x
https://doi.org/10.1007/s10792-022-02578-x
Publikováno v:
Molecular Physics. 120
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da1be39c944bbecc854312ea86b9da85
https://doi.org/10.1080/00268976.2022.2086182
https://doi.org/10.1080/00268976.2022.2086182
Publikováno v:
Optics Express. 30:47909
Liquid crystals are of great interest in the field of nonlinear optics due to their efficient response to low intensity light fields. Here we present a new, to the best of our knowledge, mechanism of a nonlinear optical response which is observed for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e513ce8642830ed5c1cc02871d0399c
https://doi.org/10.1364/oe.478321
https://doi.org/10.1364/oe.478321
Autor:
Matthew Hague, C. H. L. Ong
We present an algorithm for computing directly the denotation of a μ-calculus formula χ over the configuration graph of a pushdown system. Our method gives the first extension of the saturation technique to the full μ-calculus. Finite word automat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac1749d7202106d32f07637c4734b77b
https://doi.org/10.1016/j.ic.2010.12.004
https://doi.org/10.1016/j.ic.2010.12.004
Autor:
C.-H. L. Ong, Andrzej S. Murawski
We present a game description of free symmetric monoidal closed categories, which can also be viewed as a fully complete model for Intuitionistic multiplicative linear logic with the tensor unit. We model the unit by a distinguished one-move game cal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6500d7bde67ebe4fd88af9589c8ce3b4
https://ora.ox.ac.uk/objects/uuid:837c07ab-3f66-4040-bc24-bedb44aa9b35
https://ora.ox.ac.uk/objects/uuid:837c07ab-3f66-4040-bc24-bedb44aa9b35
Publikováno v:
Journal of the Operational Research Society. 61:611-619
In this paper, a cost-based job shop problem (JIT-JSP) is proposed to model the multi-order processing procedure in a just-in-time (JIT) environment. The objective of JIT-JSP is to minimize three costs: work-in-process holding cost of half-finished o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3cddbe099ead882b144c44172b1c561
https://doi.org/10.1057/jors.2009.9
https://doi.org/10.1057/jors.2009.9
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.
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:
Advances in Engineering Software. 39:438-443
In this paper, we propose two methods for solving a real-life soft drink distribution problem. The objective of this problem is to minimize the total number of vehicles used. The proposed methods are composite procedures involving the solution of bin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35131b467922d7a64c2664cd2ca261f3
https://doi.org/10.1016/j.advengsoft.2007.03.001
https://doi.org/10.1016/j.advengsoft.2007.03.001
Publikováno v:
Journal of the Operational Research Society. 58:528-532
In this paper, we propose a generalized crossing local search method for solving vehicle routing problems. This method is a generalization of the string crossing method described in the literature. To evaluate the performance of the proposed method,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::318cc187cdf1b0cd7f7b8687e9f9a38d
https://doi.org/10.1057/palgrave.jors.2602171
https://doi.org/10.1057/palgrave.jors.2602171