المؤلفون: Kittiphon Phalakarn, Vorapong Suppakitpaisarn, Francisco Rodríguez-Henríquez, M. Anwar Hasan

المصدر: Transactions on Cryptographic Hardware and Embedded Systems, Vol 2023, Iss 3 (2023)

مصطلحات موضوعية: Isogeny-based cryptography, Isogeny computation, Software optimization, Vectorization, Parallel computing, Precedence-constrained scheduling, Computer engineering. Computer hardware, TK7885-7895, Information technology, T58.5-58.64

وصف الملف: electronic resource

Relation: https://tches.iacr.org/index.php/TCHES/article/view/10963; https://doaj.org/toc/2569-2925

URL الوصول: https://doaj.org/article/45f00fd79742494bb9182a839c972c7f

المؤلفون: Phalakarn, Kittiphon, Suppakitpaisarn, Vorapong, Rodríguez-Henríquez, Francisco, Hasan, M. Anwar

المصدر: IACR Transactions on Cryptographic Hardware and Embedded Systems; Vol. 2023 No. 3; 246-269 ; 2569-2925

مصطلحات موضوعية: Isogeny-based cryptography, Isogeny computation, Software optimization, Vectorization, Parallel computing, Precedence-constrained scheduling

وصف الملف: application/pdf

Relation: https://tches.iacr.org/index.php/TCHES/article/view/10963/10270; https://tches.iacr.org/index.php/TCHES/article/view/10963

الاتاحة: https://tches.iacr.org/index.php/TCHES/article/view/10963

المؤلفون: Venkateshan, Prahalad, Szmerekovsky, Joseph, Vairaktarakis, George

مصطلحات موضوعية: Unrelated machine scheduling, Precedence-constrained scheduling, Optimization, Integer programming, Valid inequalities

Relation: Annals of Operations Research; Venkateshan, P., Szmerekovsky, J., & Vairaktarakis, G. (2020). A cutting plane approach for the multi-machine precedence-constrained scheduling problem. Annals of Operations Research, 285, 247-271. doi:https://doi.org/10.1007/ s10479-019-03212-3; 02545330 (Print); 15729338 (Online); http://hdl.handle.net/11718/23993

الاتاحة: http://hdl.handle.net/11718/23993

المؤلفون: Michael G. Norman, Susanna Pelagatti, Peter Thanisch

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://www.dcs.ed.ac.uk/home/pt/pubs/copies/PPL95.ps.

مصطلحات موضوعية: Precedence Constrained Scheduling, Interprocessor Communication Delays, Message Contention, NP Completeness

وصف الملف: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.9944; http://www.dcs.ed.ac.uk/home/pt/pubs/copies/PPL95.ps

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.9944
http://www.dcs.ed.ac.uk/home/pt/pubs/copies/PPL95.ps

المؤلفون: CHATZIGIANNAKIS, IOANNIS, Giannoulis, G., Spirakis, P. G.

المساهمون: Chatzigiannakis, Ioanni, Giannoulis, G., Spirakis, P. G.

مصطلحات موضوعية: Precedence-constrained scheduling, Static scheduling

وصف الملف: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-159593989-0; info:eu-repo/semantics/altIdentifier/wos/WOS:000266034700081; ispartofbook:Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; 27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing; firstpage:454; lastpage:454; numberofpages:1; http://hdl.handle.net/11573/948633; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-57549092348; https://www.scopus.com/inward/record.uri?eid=2-s2.0-57549092348&partnerID=40&md5=d6dd0d1a44f4706dfb0633d3eaa57ff9

الاتاحة: http://hdl.handle.net/11573/948633
https://www.scopus.com/inward/record.uri?eid=2-s2.0-57549092348&partnerID=40&md5=d6dd0d1a44f4706dfb0633d3eaa57ff9

المؤلفون: Nicolas E. Stier-Moses, José R. Correa, Samuel Fiorini

المصدر: Discrete Applied Mathematics. 155:257-259

مصطلحات موضوعية: Combinatorics, Job shop scheduling, Applied Mathematics, Discrete Mathematics and Combinatorics, Approximation algorithm, Precedence-constrained scheduling, Computer Science::Computational Complexity, Hardness of approximation, Performance guarantee, Approximation algorithms, Scheduling (computing), Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2480874ef0dfbf279d40e47d621a2c65
https://doi.org/10.1016/j.dam.2006.03.038

المؤلفون: GANGAL, D, RANADE, A

مصطلحات موضوعية: Processors, Precedence Constrained Scheduling, Approximation Algorithm, Deadline

Relation: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 74(7), 1139-1146; http://dx.doi.org/10.1016/j.jcss.2008.04.001; http://dspace.library.iitb.ac.in/xmlui/handle/10054/3384; http://hdl.handle.net/10054/3384

الاتاحة: http://dspace.library.iitb.ac.in/xmlui/handle/10054/3384
https://doi.org/10.1016/j.jcss.2008.04.001
http://hdl.handle.net/10054/3384

المؤلفون: Fiorini, Samuel, Correa, José, Stier-Moses, Nicolás

المصدر: Discrete applied mathematics, 155 (3

مصطلحات موضوعية: Informatique mathématique, Théorie des algorithmes, Approximation algorithms, Hardness of approximation, Precedence-constrained scheduling

وصف الملف: 1 full-text file(s): application/pdf

Relation: uri/info:doi/10.1016/j.dam.2006.03.038; uri/info:pii/S0166218X06002976; uri/info:scp/33751196994; https://dipot.ulb.ac.be/dspace/bitstream/2013/52880/1/Elsevier_28150.pdf; http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/52880

الاتاحة: http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/52880
https://dipot.ulb.ac.be/dspace/bitstream/2013/52880/1/Elsevier_28150.pdf

المؤلفون: Ioannis Chatzigiannakis, Giannoulis, G., Spirakis, P. G.

المصدر: Scopus-Elsevier

مصطلحات موضوعية: Precedence-constrained scheduling, Static scheduling

URL الوصول: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e234cbac2c28f09543ee3398ad238689
http://hdl.handle.net/11573/948633

المؤلفون: Abhiram G. Ranade

المصدر: IndraStra Global.

مصطلحات موضوعية: Discrete mathematics, Approximation Theory, Computer Networks and Communications, Applied Mathematics, Approximation algorithm, Disjoint sets, Polynomials, Longest path problem, Theoretical Computer Science, Scheduling (computing), Combinatorics, Computational Theory and Mathematics, Shortest Path Faster Algorithm, Independent set, Constraint Theory, Suurballe's algorithm, Precedence-constrained scheduling, Time complexity, Algorithms, MathematicsofComputing_DISCRETEMATHEMATICS, Mathematics

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d475b2b0e56cb501c339f5aed3d39f6
https://igi.indrastra.com/items/show/57643

المؤلفون: Politopoulos, K, Georgakopoulos, GF, Tsanakas, P

مصطلحات موضوعية: Computer Science, Hardware & Architecture, Information Systems, Software Engineering, Algorithms, Computational complexity, Constraint theory, Graph theory, Online systems, Polynomials, Response time (computer systems), Scheduling, Theorem proving, Limited lookahead technique, Precedence constrained scheduling, Task graphs, Unit execution time, Parallel processing systems

Relation: ISI:000169766600003; 44; 163; 173

الاتاحة: https://doi.org/10.1093/comjnl/44.3.163