Zobrazeno 1 - 10
of 51
pro vyhledávání: '"Wang, Pengming"'
Autor:
Wang, Pengming, Sazanovich, Mikita, Ilbeyi, Berkin, Phothilimthana, Phitchaya Mangpo, Purohit, Manish, Tay, Han Yang, Vũ, Ngân, Wang, Miaosen, Paduraru, Cosmin, Leurent, Edouard, Zhernov, Anton, Huang, Po-Sen, Schrittwieser, Julian, Hubert, Thomas, Tung, Robert, Kurylowicz, Paula, Milan, Kieran, Vinyals, Oriol, Mankowitz, Daniel J.
Resource scheduling and allocation is a critical component of many high impact systems ranging from congestion control to cloud computing. Finding more optimal solutions to these problems often has significant impact on resource and time savings, red
Externí odkaz:
http://arxiv.org/abs/2305.07440
Publikováno v:
In Advanced Engineering Informatics October 2024 62 Part D
Large Neighborhood Search (LNS) is a combinatorial optimization heuristic that starts with an assignment of values for the variables to be optimized, and iteratively improves it by searching a large neighborhood around the current assignment. In this
Externí odkaz:
http://arxiv.org/abs/2107.10201
Autor:
Nair, Vinod, Bartunov, Sergey, Gimeno, Felix, von Glehn, Ingrid, Lichocki, Pawel, Lobov, Ivan, O'Donoghue, Brendan, Sonnerat, Nicolas, Tjandraatmadja, Christian, Wang, Pengming, Addanki, Ravichandra, Hapuarachchi, Tharindi, Keck, Thomas, Keeling, James, Kohli, Pushmeet, Ktena, Ira, Li, Yujia, Vinyals, Oriol, Zwols, Yori
Mixed Integer Programming (MIP) solvers rely on an array of sophisticated heuristics developed with decades of research to solve large-scale MIP instances encountered in practice. Machine learning offers to automatically construct better heuristics f
Externí odkaz:
http://arxiv.org/abs/2012.13349
Autor:
Wang, Pengming
Constraint problems are a powerful framework in which many common combinatorial problems can be expressed. Examples include graph colouring problems, Boolean satisfaction, graph cut problems, systems of equations, and many more. One typically disting
Externí odkaz:
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744877
Autor:
Wang, Pengming1 (AUTHOR), Kamruzzaman, M. M.2 (AUTHOR) mmkamruzzaman@ju.edu.sa, Chen, Qing3 (AUTHOR)
Publikováno v:
Neural Computing & Applications. Feb2024, Vol. 36 Issue 5, p2155-2170. 16p.
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.
Pebble games are a powerful tool in the study of finite model theory, constraint satisfaction and database theory. Monads and comonads are basic notions of category theory which are widely used in semantics of computation and in modern functional pro
Externí odkaz:
http://arxiv.org/abs/1704.05124
Autor:
Dawar, Anuj, Wang, Pengming
For a large class of optimization problems, namely those that can be expressed as finite-valued constraint satisfaction problems (VCSPs), we establish a dichotomy on the number of levels of the Lasserre hierarchy of semi-definite programs (SDPs) that
Externí odkaz:
http://arxiv.org/abs/1602.05409