Статті в журналах з теми "Deterministic constant time algorithms"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Deterministic constant time algorithms".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Jayanti, Prasad, and Siddhartha Jayanti. "Deterministic Constant-Amortized-RMR Abortable Mutex for CC and DSM." ACM Transactions on Parallel Computing 8, no. 4 (December 31, 2021): 1–26. http://dx.doi.org/10.1145/3490559.
Повний текст джерелаSUEL, TORSTEN. "PERMUTATION ROUTING AND SORTING ON MESHES WITH ROW AND COLUMN BUSES." Parallel Processing Letters 05, no. 01 (March 1995): 63–80. http://dx.doi.org/10.1142/s0129626495000072.
Повний текст джерелаDAS, SAJAL K., and RANETTE H. HALVERSON. "SIMPLE DETERMINISTIC AND RANDOMIZED ALGORITHMS FOR LINKED LIST RANKING ON THE EREW PRAM MODEL." Parallel Processing Letters 04, no. 01n02 (June 1994): 15–27. http://dx.doi.org/10.1142/s012962649400003x.
Повний текст джерелаKhadiev, Kamil, and Vladislav Remidovskii. "Classical and Quantum Algorithms for Assembling a Text from a Dictionary." Nonlinear Phenomena in Complex Systems 24, no. 3 (October 12, 2021): 207–21. http://dx.doi.org/10.33581/1561-4085-2021-24-3-207-221.
Повний текст джерелаAllender, Eric, V. Arvind, Rahul Santhanam, and Fengming Wang. "Uniform derandomization from pathetic lower bounds." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 370, no. 1971 (July 28, 2012): 3512–35. http://dx.doi.org/10.1098/rsta.2011.0318.
Повний текст джерелаRajasekaran, Sanguthevar. "On the Euclidean Minimum Spanning Tree Problem." Computing Letters 1, no. 1 (March 6, 2005): 11–14. http://dx.doi.org/10.1163/1574040053326325.
Повний текст джерелаEfthymiou, Charilaos. "Deterministic counting of graph colourings using sequences of subgraphs." Combinatorics, Probability and Computing 29, no. 4 (June 22, 2020): 555–86. http://dx.doi.org/10.1017/s0963548320000255.
Повний текст джерелаTarnawski, Jakub. "New graph algorithms via polyhedral techniques." it - Information Technology 63, no. 3 (April 15, 2021): 177–82. http://dx.doi.org/10.1515/itit-2021-0014.
Повний текст джерелаHu, Xiao-Bing, Ming Wang, Mark S. Leeson, Ezequiel A. Di Paolo, and Hao Liu. "Deterministic Agent-Based Path Optimization by Mimicking the Spreading of Ripples." Evolutionary Computation 24, no. 2 (June 2016): 319–46. http://dx.doi.org/10.1162/evco_a_00156.
Повний текст джерелаMehta, Dinesh P., Carl Shetters, and Donald W. Bouldin. "Meta-Algorithms for Scheduling a Chain of Coarse-Grained Tasks on an Array of Reconfigurable FPGAs." VLSI Design 2013 (December 25, 2013): 1–13. http://dx.doi.org/10.1155/2013/249592.
Повний текст джерелаHsu, Geesern, Andrew E. Yagle, Kenneth C. Ludema, and Joel A. Levitt. "Modeling and Identification of Lubricated Polymer Friction Dynamics." Journal of Dynamic Systems, Measurement, and Control 122, no. 1 (October 11, 1996): 78–88. http://dx.doi.org/10.1115/1.482431.
Повний текст джерелаHERLEY, KIERAN T., ANDREA PIETRACAPRINA, and GEPPINO PUCCI. "FAST DETERMINISTIC PARALLEL BRANCH-AND-BOUND." Parallel Processing Letters 09, no. 03 (September 1999): 325–33. http://dx.doi.org/10.1142/s012962649900030x.
Повний текст джерелаSingh, Mohit, and Weijun Xie. "Approximation Algorithms for D-optimal Design." Mathematics of Operations Research 45, no. 4 (November 2020): 1512–34. http://dx.doi.org/10.1287/moor.2019.1041.
Повний текст джерелаBramas, Quentin, and Sébastien Tixeuil. "The Random Bit Complexity of Mobile Robots Scattering." International Journal of Foundations of Computer Science 28, no. 02 (February 2017): 111–33. http://dx.doi.org/10.1142/s0129054117500083.
Повний текст джерелаDatta, Ajoy K., Stephane Devismes, Lawrence L. Larmore, and Vincent Villain. "Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge." Parallel Processing Letters 27, no. 02 (June 2017): 1750002. http://dx.doi.org/10.1142/s0129626417500025.
Повний текст джерелаŁawryńczuk, Maciej. "Nonlinear State–Space Predictive Control with On–Line Linearisation and State Estimation." International Journal of Applied Mathematics and Computer Science 25, no. 4 (December 1, 2015): 833–47. http://dx.doi.org/10.1515/amcs-2015-0060.
Повний текст джерелаLiang, Dieyan, and Hong Shen. "Efficient Algorithms for Max-Weighted Point Sweep Coverage on Lines." Sensors 21, no. 4 (February 19, 2021): 1457. http://dx.doi.org/10.3390/s21041457.
Повний текст джерелаHERLEY, KIERAN T., ANDREA PIETRACAPRINA, and GEPPINO PUCCI. "DETERMINISTIC BRANCH-AND-BOUND ON DISTRIBUTED MEMORY MACHINES." International Journal of Foundations of Computer Science 10, no. 04 (December 1999): 391–404. http://dx.doi.org/10.1142/s0129054199000289.
Повний текст джерелаArenas, Marcelo, Luis Alberto Croquevielle, Rajesh Jayaram, and Cristian Riveros. "#NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes." Journal of the ACM 68, no. 6 (December 31, 2021): 1–40. http://dx.doi.org/10.1145/3477045.
Повний текст джерелаCABELLO, SERGIO, MARK DE BERG, PANOS GIANNOPOULOS, CHRISTIAN KNAUER, RENÉ VAN OOSTRUM, and REMCO C. VELTKAMP. "MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION." International Journal of Computational Geometry & Applications 19, no. 06 (December 2009): 533–56. http://dx.doi.org/10.1142/s0218195909003118.
Повний текст джерелаEzemobi, Ethelbert, Andrea Tonoli, and Mario Silvagni. "Battery State of Health Estimation with Improved Generalization Using Parallel Layer Extreme Learning Machine." Energies 14, no. 8 (April 16, 2021): 2243. http://dx.doi.org/10.3390/en14082243.
Повний текст джерелаBEGGS, EDWIN J., JOSÉ FÉLIX COSTA, and JOHN V. TUCKER. "The impact of models of a physical oracle on computational power." Mathematical Structures in Computer Science 22, no. 5 (September 6, 2012): 853–79. http://dx.doi.org/10.1017/s0960129511000557.
Повний текст джерелаAL-SAFAR, AHMED. "Hybrid CPU Scheduling algorithm SJF-RR In Static Set of Processes." Journal of Al-Rafidain University College For Sciences ( Print ISSN: 1681-6870 ,Online ISSN: 2790-2293 ), no. 1 (October 20, 2021): 36–60. http://dx.doi.org/10.55562/jrucs.v29i1.377.
Повний текст джерелаMa, Jingjing. "3D DNA Self-Assembly Algorithmic Model to Solve the Hamiltonian Path Problem." Journal of Nanoelectronics and Optoelectronics 16, no. 5 (May 1, 2021): 731–37. http://dx.doi.org/10.1166/jno.2021.3000.
Повний текст джерелаPORSCHEN, STEFAN. "ON RECTANGULAR COVERING PROBLEMS." International Journal of Computational Geometry & Applications 19, no. 04 (August 2009): 325–40. http://dx.doi.org/10.1142/s0218195909002988.
Повний текст джерелаAgafonov, Anton, and Vladislav Myasnikov. "Method for Reliable Shortest Path Determination in Stochastic Networks using Parametrically Defined Stable Probability Distributions." SPIIRAS Proceedings 18, no. 3 (June 5, 2019): 558–82. http://dx.doi.org/10.15622/sp.2019.18.3.557-581.
Повний текст джерелаCampbell, Kayleigh, Laura Staugler, and Andrea Arnold. "Estimating Time-Varying Applied Current in the Hodgkin-Huxley Model." Applied Sciences 10, no. 2 (January 11, 2020): 550. http://dx.doi.org/10.3390/app10020550.
Повний текст джерелаBoje, Edward. "Representation of simulation errors in single step methods using state dependent noise." MATEC Web of Conferences 347 (2021): 00001. http://dx.doi.org/10.1051/matecconf/202134700001.
Повний текст джерелаBannai, Hideo, Travis Gagie, Gary Hoppenworth, Simon J. Puglisi, and Luís M. S. Russo. "More Time-Space Tradeoffs for Finding a Shortest Unique Substring." Algorithms 13, no. 9 (September 18, 2020): 234. http://dx.doi.org/10.3390/a13090234.
Повний текст джерелаFERREIRA, AFONSO, and NICOLAS SCHABANEL. "A RANDOMIZED BSP/CGM ALGORITHM FOR THE MAXIMAL INDEPENDENT SET PROBLEM." Parallel Processing Letters 09, no. 03 (September 1999): 411–22. http://dx.doi.org/10.1142/s0129626499000384.
Повний текст джерелаBARLOW, MARTIN T., JIAN DING, ASAF NACHMIAS, and YUVAL PERES. "The Evolution of the Cover Time." Combinatorics, Probability and Computing 20, no. 3 (February 15, 2011): 331–45. http://dx.doi.org/10.1017/s0963548310000489.
Повний текст джерелаArsenault, Richard, and Pascal Côté. "Analysis of the effects of biases in ensemble streamflow prediction (ESP) forecasts on electricity production in hydropower reservoir management." Hydrology and Earth System Sciences 23, no. 6 (June 28, 2019): 2735–50. http://dx.doi.org/10.5194/hess-23-2735-2019.
Повний текст джерелаSergi, Alessandro, Gabriel Hanna, Roberto Grimaudo, and Antonino Messina. "Quasi-Lie Brackets and the Breaking of Time-Translation Symmetry for Quantum Systems Embedded in Classical Baths." Symmetry 10, no. 10 (October 16, 2018): 518. http://dx.doi.org/10.3390/sym10100518.
Повний текст джерелаDalzell, Alexander M., Aram W. Harrow, Dax Enshan Koh, and Rolando L. La Placa. "How many qubits are needed for quantum computational supremacy?" Quantum 4 (May 11, 2020): 264. http://dx.doi.org/10.22331/q-2020-05-11-264.
Повний текст джерелаKhoshjahan, Yazdan. "A Study of Resource-Constrained Project Optimization with Discounted Weighted Earliness-Tardiness Penalty Costs." Advanced Materials Research 488-489 (March 2012): 898–903. http://dx.doi.org/10.4028/www.scientific.net/amr.488-489.898.
Повний текст джерелаSu, Huanyin, Feng Shi, Guangming Xu, Jin Qin, and Xinghua Shan. "Schedule-Based Passenger Assignment for High-Speed Rail Networks considering the Ticket-Booking Process." Mathematical Problems in Engineering 2016 (2016): 1–15. http://dx.doi.org/10.1155/2016/1650839.
Повний текст джерелаAbbad, Brahim, and Bjørn Ursin. "High-resolution bootstrapped differential semblance." GEOPHYSICS 77, no. 3 (May 1, 2012): U39—U47. http://dx.doi.org/10.1190/geo2011-0231.1.
Повний текст джерелаKoehler, Fulton, and M. Turhan Taner. "The use of the conjugate‐gradient algorithm in the computation of predictive deconvolution operators." GEOPHYSICS 50, no. 12 (December 1985): 2752–58. http://dx.doi.org/10.1190/1.1441895.
Повний текст джерелаGuruswami, Venkatesan, and Chaoping Xing. "Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes." Journal of the ACM 69, no. 2 (April 30, 2022): 1–48. http://dx.doi.org/10.1145/3506668.
Повний текст джерелаKohútka, Lukáš, Lukáš Nagy, and Viera Stopjaková. "Hardware Dynamic Memory Manager for Hard Real-Time Systems." Annals of Emerging Technologies in Computing 3, no. 4 (October 1, 2019): 48–70. http://dx.doi.org/10.33166/aetic.2019.04.005.
Повний текст джерелаHou, Jing, Yan Yang, He He, and Tian Gao. "Adaptive Dual Extended Kalman Filter Based on Variational Bayesian Approximation for Joint Estimation of Lithium-Ion Battery State of Charge and Model Parameters." Applied Sciences 9, no. 9 (April 26, 2019): 1726. http://dx.doi.org/10.3390/app9091726.
Повний текст джерелаWu, Liangshun, and Hengjin Cai. "Novel Stream Ciphering Algorithm for Big Data Images Using Zeckendorf Representation." Wireless Communications and Mobile Computing 2021 (October 21, 2021): 1–19. http://dx.doi.org/10.1155/2021/4637876.
Повний текст джерелаAlfonso, L. "An algorithm for the numerical solution of the multivariate master equation for stochastic coalescence." Atmospheric Chemistry and Physics Discussions 15, no. 8 (April 23, 2015): 12213–40. http://dx.doi.org/10.5194/acpd-15-12213-2015.
Повний текст джерелаAlfonso, L. "An algorithm for the numerical solution of the multivariate master equation for stochastic coalescence." Atmospheric Chemistry and Physics 15, no. 21 (November 6, 2015): 12315–26. http://dx.doi.org/10.5194/acp-15-12315-2015.
Повний текст джерелаLimon-Cantu, David, and Vicente Alarcon-Aquino. "Multiresolution dendritic cell algorithm for network anomaly detection." PeerJ Computer Science 7 (October 19, 2021): e749. http://dx.doi.org/10.7717/peerj-cs.749.
Повний текст джерелаPlaskura, Paweł. "MODELLING OF FORGETTING CURVES IN EDUCATIONAL E-ENVIRONMENT." Information Technologies and Learning Tools 71, no. 3 (June 29, 2019): 1. http://dx.doi.org/10.33407/itlt.v71i3.2368.
Повний текст джерелаChakrabarty, Anindya, Zongwei Luo, Rameshwar Dubey, and Shan Jiang. "A theoretical model of jump diffusion-mean reversion." Business Process Management Journal 23, no. 3 (June 5, 2017): 537–54. http://dx.doi.org/10.1108/bpmj-01-2016-0005.
Повний текст джерелаLAWLOR, DAVID, YANG WANG, and ANDREW CHRISTLIEB. "ADAPTIVE SUB-LINEAR TIME FOURIER ALGORITHMS." Advances in Adaptive Data Analysis 05, no. 01 (January 2013): 1350003. http://dx.doi.org/10.1142/s1793536913500039.
Повний текст джерелаIvanyos, Gábor, Marek Karpinski, and Nitin Saxena. "Deterministic Polynomial Time Algorithms for Matrix Completion Problems." SIAM Journal on Computing 39, no. 8 (January 2010): 3736–51. http://dx.doi.org/10.1137/090781231.
Повний текст джерелаBONFANTE, G., A. CICHON, J. Y. MARION, and H. TOUZET. "Algorithms with polynomial interpretation termination proof." Journal of Functional Programming 11, no. 1 (January 2001): 33–53. http://dx.doi.org/10.1017/s0956796800003877.
Повний текст джерела