Статті в журналах з теми "Closest string problem"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Closest string problem".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Chen, Zhi-Zhong, Bin Ma, and Lusheng Wang. "A three-string approach to the closest string problem." Journal of Computer and System Sciences 78, no. 1 (January 2012): 164–78. http://dx.doi.org/10.1016/j.jcss.2011.01.003.
Повний текст джерелаMousavi, Sayyed Rasoul. "A hybrid metaheuristic for Closest String Problem." International Journal of Computational Biology and Drug Design 4, no. 3 (2011): 245. http://dx.doi.org/10.1504/ijcbdd.2011.041413.
Повний текст джерелаKelsey, Tom, and Lars Kotthoff. "Exact Closest String as a Constraint Satisfaction Problem." Procedia Computer Science 4 (2011): 1062–71. http://dx.doi.org/10.1016/j.procs.2011.04.113.
Повний текст джерелаYuasa, Shota, Zhi-Zhong Chen, Bin Ma, and Lusheng Wang. "Designing and implementing algorithms for the closest string problem." Theoretical Computer Science 786 (September 2019): 32–43. http://dx.doi.org/10.1016/j.tcs.2018.05.017.
Повний текст джерелаChen, Zhi-Zhong, Bin Ma, and Lusheng Wang. "Randomized Fixed-Parameter Algorithms for the Closest String Problem." Algorithmica 74, no. 1 (October 28, 2014): 466–84. http://dx.doi.org/10.1007/s00453-014-9952-y.
Повний текст джерелаGomes, Fernando C., Cláudio N. Meneses, Panos M. Pardalos, and Gerardo Valdisio R. Viana. "A parallel multistart algorithm for the closest string problem." Computers & Operations Research 35, no. 11 (November 2008): 3636–43. http://dx.doi.org/10.1016/j.cor.2007.04.002.
Повний текст джерелаLiu, Xiaolan, Shenghan Liu, Zhifeng Hao, and Holger Mauch. "Exact algorithm and heuristic for the Closest String Problem." Computers & Operations Research 38, no. 11 (November 2011): 1513–20. http://dx.doi.org/10.1016/j.cor.2011.01.009.
Повний текст джерелаDella Croce, F., and F. Salassa. "Improved LP-based algorithms for the closest string problem." Computers & Operations Research 39, no. 3 (March 2012): 746–49. http://dx.doi.org/10.1016/j.cor.2011.06.010.
Повний текст джерелаDella Croce, Federico, and Michele Garraffa. "The Selective Fixing Algorithm for the closest string problem." Computers & Operations Research 41 (January 2014): 24–30. http://dx.doi.org/10.1016/j.cor.2013.07.017.
Повний текст джерелаHermelin, Danny, and Liat Rozenberg. "Parameterized complexity analysis for the Closest String with Wildcards problem." Theoretical Computer Science 600 (October 2015): 11–18. http://dx.doi.org/10.1016/j.tcs.2015.06.043.
Повний текст джерелаMeneses, Cláudio N., Zhaosong Lu, Carlos A. S. Oliveira, and Panos M. Pardalos. "Optimal Solutions for the Closest-String Problem via Integer Programming." INFORMS Journal on Computing 16, no. 4 (November 2004): 419–29. http://dx.doi.org/10.1287/ijoc.1040.0090.
Повний текст джерелаPappalardo, Elisa, Domenico Cantone, and Panos M. Pardalos. "A combinedgreedy-walkheuristic and simulated annealing approach for the closest string problem." Optimization Methods and Software 29, no. 4 (October 2013): 673–702. http://dx.doi.org/10.1080/10556788.2013.833616.
Повний текст джерелаTanaka, Shunji. "A heuristic algorithm based on Lagrangian relaxation for the closest string problem." Computers & Operations Research 39, no. 3 (March 2012): 709–17. http://dx.doi.org/10.1016/j.cor.2011.06.005.
Повний текст джерелаHankin, Robin K. S. "Light Inextensible Strings (Thread) Under Tension in the Schwarzschild Geometry." Physics Educator 03, no. 02 (June 2021): 2150005. http://dx.doi.org/10.1142/s2661339521500050.
Повний текст джерелаSutton, Andrew M. "Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String Problem." Algorithmica 83, no. 4 (February 15, 2021): 1138–63. http://dx.doi.org/10.1007/s00453-021-00809-8.
Повний текст джерелаMousavi, Sayyed Rasoul, and Navid Nasr Esfahani. "A GRASP algorithm for the Closest String Problem using a probability-based heuristic." Computers & Operations Research 39, no. 2 (February 2012): 238–48. http://dx.doi.org/10.1016/j.cor.2011.02.025.
Повний текст джерелаArbib, Claudio, Mara Servilio, and Paolo Ventura. "An improved integer linear programming formulation for the closest 0-1 string problem." Computers & Operations Research 80 (April 2017): 94–100. http://dx.doi.org/10.1016/j.cor.2016.11.019.
Повний текст джерелаLi, Ming, Bin Ma, and Lusheng Wang. "On the closest string and substring problems." Journal of the ACM 49, no. 2 (March 2002): 157–71. http://dx.doi.org/10.1145/506147.506150.
Повний текст джерелаButnaru, Andrei-Mădălin. "Machine learning applied in natural language processing." ACM SIGIR Forum 54, no. 1 (June 2020): 1–3. http://dx.doi.org/10.1145/3451964.3451979.
Повний текст джерелаMa, Bin, and Xiaoming Sun. "More Efficient Algorithms for Closest String and Substring Problems." SIAM Journal on Computing 39, no. 4 (January 2010): 1432–43. http://dx.doi.org/10.1137/080739069.
Повний текст джерелаGramm, Niedermeier, and Rossmanith. "Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems." Algorithmica 37, no. 1 (September 2003): 25–42. http://dx.doi.org/10.1007/s00453-003-1028-3.
Повний текст джерелаAlamro, Hayam, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Wing-Kin Sung, and Steven Watts. "Efficient Identification of k-Closed Strings." International Journal of Foundations of Computer Science 31, no. 05 (August 2020): 595–610. http://dx.doi.org/10.1142/s0129054120500288.
Повний текст джерелаZörnig, Peter. "Improved optimization modelling for the closest string and related problems." Applied Mathematical Modelling 35, no. 12 (December 2011): 5609–17. http://dx.doi.org/10.1016/j.apm.2011.05.015.
Повний текст джерелаZWIEBACH, BARTON. "INTERPOLATING STRING FIELD THEORIES." Modern Physics Letters A 07, no. 12 (April 20, 1992): 1079–90. http://dx.doi.org/10.1142/s0217732392000951.
Повний текст джерелаPark, Jeong-Hyuck. "Stringy Gravity: Solving the Dark Problems at ‘short’ distance." EPJ Web of Conferences 168 (2018): 01010. http://dx.doi.org/10.1051/epjconf/201816801010.
Повний текст джерелаZwiebach, Barton. "How covariant closed string theory solves a minimal area problem." Communications in Mathematical Physics 136, no. 1 (February 1991): 83–118. http://dx.doi.org/10.1007/bf02096792.
Повний текст джерелаPOPOV, A. D. "FUNDAMENTAL CHIRAL STRINGS." Modern Physics Letters A 06, no. 26 (August 30, 1991): 2423–28. http://dx.doi.org/10.1142/s0217732391002840.
Повний текст джерелаMuslihin, Khoirunnisa Rohadatul Aisy, Endang Rusyaman, and Diah Chaerani. "Conic Duality for Multi-Objective Robust Optimization Problem." Mathematics 10, no. 21 (October 24, 2022): 3940. http://dx.doi.org/10.3390/math10213940.
Повний текст джерелаKhachatryan, Kh A., and H. S. Petrosyan. "Solvability of a Nonlinear Problem in Open-Closed $$ {\boldsymbol {p}}$$-Adic String Theory." Differential Equations 56, no. 10 (October 2020): 1371–78. http://dx.doi.org/10.1134/s00122661200100134.
Повний текст джерелаDikhtyaruk, N., and E. Poplavskaya. "Plane contact problem on the interaction of a pre-stressed strip with an infinite inhomogeneous stringer." Problems of tribology 97, no. 3 (September 28, 2020): 55–63. http://dx.doi.org/10.31891/2079-1372-2020-97-3-55-63.
Повний текст джерелаCHEN, DANNY Z., and EWA MISIOŁEK. "FINDING MANY OPTIMAL PATHS WITHOUT GROWING ANY OPTIMAL PATH TREES." International Journal of Computational Geometry & Applications 20, no. 04 (August 2010): 449–69. http://dx.doi.org/10.1142/s0218195910003384.
Повний текст джерелаChen, Yuanmei, Haizhen Ren, Lei Zhang, and Yang Zhao. "Computation of Differential in Strong Product Network of Paths via Recursive Iteration." Journal of Physics: Conference Series 2025, no. 1 (September 1, 2021): 012050. http://dx.doi.org/10.1088/1742-6596/2025/1/012050.
Повний текст джерелаCECOTTI, S., S. FERRARA, L. GIRARDELLO, A. PASQUINUCCI, and M. PORRATI. "MATTER-COUPLED SUPERGRAVITY WITH GAUSS-BONNET INVARIANTS: COMPONENT LAGRANGIAN AND SUPERSYMMETRY BREAKING." International Journal of Modern Physics A 03, no. 07 (July 1988): 1675–733. http://dx.doi.org/10.1142/s0217751x88000734.
Повний текст джерелаChicano, Francisco, Andrew M. Sutton, L. Darrell Whitley, and Enrique Alba. "Fitness Probability Distribution of Bit-Flip Mutation." Evolutionary Computation 23, no. 2 (June 2015): 217–48. http://dx.doi.org/10.1162/evco_a_00130.
Повний текст джерелаDawson, William J. "Upper-extremity Problems Caused by Playing Specific Instruments." Medical Problems of Performing Artists 17, no. 3 (September 1, 2002): 135–40. http://dx.doi.org/10.21091/mppa.2002.3022.
Повний текст джерелаFILIPPOV, A. T., and A. P. ISAEV. "GAUGE MODELS OF “DISCRETE STRINGS”." Modern Physics Letters A 04, no. 22 (October 30, 1989): 2167–76. http://dx.doi.org/10.1142/s0217732389002434.
Повний текст джерелаWANG, ZI-MING, AIRONG WEI, and POOM KUMAM. "Hybrid Bregman projection methods for fixed point and equilibrium problems." Carpathian Journal of Mathematics 34, no. 3 (2018): 441–47. http://dx.doi.org/10.37193/cjm.2018.03.21.
Повний текст джерелаPalese, Marcella. "Variations by generalized symmetries of local Noether strong currents equivalent to global canonical Noether currents." Communications in Mathematics 24, no. 2 (December 1, 2016): 125–35. http://dx.doi.org/10.1515/cm-2016-0009.
Повний текст джерелаRYANG, SHIJONG. "ASYMPTOTIC AdS STRING SOLUTIONS FOR NULL POLYGONAL WILSON LOOPS IN R1,2." Modern Physics Letters A 25, no. 30 (September 28, 2010): 2555–69. http://dx.doi.org/10.1142/s021773231003375x.
Повний текст джерелаGao, Fugen, Xiaoxiao Liu, and Xiaochun Li. "Strong Convergence on the Split Feasibility Problem by Mixing W -Mapping." Journal of Mathematics 2021 (May 27, 2021): 1–6. http://dx.doi.org/10.1155/2021/9924937.
Повний текст джерелаWu, C. S., M. Budhu, and S. El-Kholy. "Finite strain elastic closed form solutions for some axisymmetric problems." Acta Mechanica 97, no. 1-2 (March 1993): 1–22. http://dx.doi.org/10.1007/bf01173138.
Повний текст джерелаWang, Shenghua, and Shin Min Kang. "Strong Convergence Iterative Algorithms for Equilibrium Problems and Fixed Point Problems in Banach Spaces." Abstract and Applied Analysis 2013 (2013): 1–9. http://dx.doi.org/10.1155/2013/619762.
Повний текст джерелаPerez, R. A., O. D. I. Nwokah, and D. F. Thompson. "Strong Diagonal Dominance by Quantitative Feedback Theory." Journal of Dynamic Systems, Measurement, and Control 115, no. 2A (June 1, 1993): 246–52. http://dx.doi.org/10.1115/1.2899028.
Повний текст джерелаWang, C. Y., C. M. Wang, and R. Freund. "Vibration of Heavy String Tethered to Mass–Spring System." International Journal of Structural Stability and Dynamics 17, no. 04 (April 6, 2017): 1771002. http://dx.doi.org/10.1142/s021945541771002x.
Повний текст джерелаZhi-Zhong Chen and Lusheng Wang. "Fast Exact Algorithms for the Closest String and Substring Problems with Application to the Planted (L,d)-Motif Model." IEEE/ACM Transactions on Computational Biology and Bioinformatics 8, no. 5 (September 2011): 1400–1410. http://dx.doi.org/10.1109/tcbb.2011.21.
Повний текст джерелаVakili, Javad, and Rouhollah Sadighidizaji. "Finding the closest efficient targets in DEA by a numeration method: the FDH non-convex technology." Boletim da Sociedade Paranaense de Matemática 41 (December 23, 2022): 1–14. http://dx.doi.org/10.5269/bspm.51654.
Повний текст джерелаTian, Ming, and Li-Hua Huang. "A General Approximation Method for a Kind of Convex Optimization Problems in Hilbert Spaces." Journal of Applied Mathematics 2014 (2014): 1–9. http://dx.doi.org/10.1155/2014/156073.
Повний текст джерелаXu, You Liang. "Description of Large Deformation Problem Using Means of Visual Strain." Applied Mechanics and Materials 275-277 (January 2013): 16–22. http://dx.doi.org/10.4028/www.scientific.net/amm.275-277.16.
Повний текст джерелаAsoodeh, Shahab, and Flavio P. Calmon. "Bottleneck Problems: An Information and Estimation-Theoretic View." Entropy 22, no. 11 (November 20, 2020): 1325. http://dx.doi.org/10.3390/e22111325.
Повний текст джерелаIsiogugu, Obiageli, Paranjothi Pillay, and Osuo-Siseken Uzoma-Oguguo. "Strong convergence of a selection of ishikawa-reich-sabach-type algorithm." Filomat 33, no. 6 (2019): 1505–16. http://dx.doi.org/10.2298/fil1906505i.
Повний текст джерела