Zobrazeno 1 - 10
of 204
pro vyhledávání: '"Backjumping"'
Publikováno v:
IEEE Access, Vol 11, Pp 97699-97715 (2023)
In the conventional successive cancellation (SC) decoder for polar codes, all the future bits to be estimated later are treated as random variables. However, polar codes inevitably involve frozen bits, and their concatenated coding schemes also inclu
Externí odkaz:
https://doaj.org/article/83644ade167248eca95ffba2fa8e7747
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.
Autor:
Syed Zain R. Rizvi, Philip W. L. Fong
Publikováno v:
ACM Transactions on Privacy and Security. 23:1-33
Neo4j is a popular graph database that offers two versions: an enterprise edition and a community edition . The enterprise edition offers customizable Role-based Access Control features through custom developed procedures , while the community editio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a69b577a9deeacac06c28920f9822b6
https://doi.org/10.1145/3401027
https://doi.org/10.1145/3401027
Publikováno v:
THE THIRD INTERNATIONAL CONFERENCE ON MATHEMATICS: Education, Theory and Application.
The conflict driven clause learning or CDCL is one of algorithm widely used in a lot of modern SAT solvers. It is because CDCL SAT solvers are so effective in practice, thanks to its non-chronological backjumping and conflict analysis. In this paper,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b19bdeb500838477ca2beacd027545b9
https://doi.org/10.1063/5.0039296
https://doi.org/10.1063/5.0039296
ISO Prolog provides catch and throw to realize the control flow of exception handling. This pearl demonstrates that catch and throw are inconspicuously amenable to the implementation of backjumping. In fact, they have precisely the semantics required
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ffa7dff7563d0ea4941bb67c925bbbd9
https://kar.kent.ac.uk/82447/7/div-class-title-backjumping-is-exception-handling-div.pdf
https://kar.kent.ac.uk/82447/7/div-class-title-backjumping-is-exception-handling-div.pdf
Autor:
Mohammad Shahraeeni
Publikováno v:
Mathematical Geosciences. 51:155-186
During a conventional multiple-point statistics simulation, the algorithm may not find a matched neighborhood in the training image for some unsimulated pixels. These pixels are referred to as the dead-end pixels; the existence of the dead-end pixels
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b41d618e36f57c1a3ae45783a8266cff
https://doi.org/10.1007/s11004-018-9761-y
https://doi.org/10.1007/s11004-018-9761-y
Publikováno v:
Swarm and Evolutionary Computation. 36:124-135
Distributed assembly permutation flow-shop scheduling problem (DAPFSP) is recognized as an important class of problems in modern supply chains and manufacturing systems. In this paper, a backtracking search hyper-heuristic (BS-HH) algorithm is propos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd7f88207b0ad833d9ce31ef3184f61a
https://doi.org/10.1016/j.swevo.2017.04.007
https://doi.org/10.1016/j.swevo.2017.04.007
Publikováno v:
Journal of Applied Logic. 17:14-24
We present a new prefixed tableau system TK for verification of validity in modal logic K. The system TK is deterministic, it uniquely generates exactly one proof tree for each clausal representation of formulas, and, moreover, it uses some syntactic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b80eb0baafe008504a5ad17f39946352
https://doi.org/10.1016/j.jal.2015.09.005
https://doi.org/10.1016/j.jal.2015.09.005
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.
Autor:
Jia Hui Liang, Vijay Ganesh, Krzysztof Czarnecki, Christoph M. Wintersteiger, Ruben Martins, Robert Robere, Edward Zulkoski
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319983332
CP
CP
Restarts are a pivotal aspect of conflict-driven clause-learning (CDCL) SAT solvers, yet it remains unclear when they are favorable in practice, and whether they offer additional power in theory. In this paper, we consider the power of restarts throu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::574f51a50d09c44f3fcc82208843cb1a
https://doi.org/10.1007/978-3-319-98334-9_30
https://doi.org/10.1007/978-3-319-98334-9_30