Journal articles on the topic 'Complete search'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Complete search.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
Paty, Morgan. "Academic Search Complete." Charleston Advisor 14, no. 3 (January 1, 2013): 5–7. http://dx.doi.org/10.5260/chara.14.3.5.
Full textMai, J. L., and D. Zielinski. "Complete enumeration: a search for wholeness." Journal of Mathematics and the Arts 1, no. 3 (September 2007): 159–72. http://dx.doi.org/10.1080/17513470701734989.
Full text�sterg�rd, Patric R. J. "Computer search for small complete caps." Journal of Geometry 69, no. 1-2 (November 2000): 172–79. http://dx.doi.org/10.1007/bf01237484.
Full textGREENLAW, RAYMOND. "BREADTH-DEPTH SEARCH IS ${\mathcal P}$-COMPLETE." Parallel Processing Letters 03, no. 03 (September 1993): 209–22. http://dx.doi.org/10.1142/s0129626493000253.
Full textJohn, Collether. "Complete Neighbourhood Search Heuristic Algorithm for Portfolio Optimization." Tanzania Journal of Engineering and Technology 40, no. 2 (February 20, 2022): 97–104. http://dx.doi.org/10.52339/tjet.v40i2.736.
Full textPollmann, Stefan, and Eran Zaidel. "Redundancy gains for visual search after complete commissurotomy." Neuropsychology 13, no. 2 (1999): 246–58. http://dx.doi.org/10.1037/0894-4105.13.2.246.
Full textWeixia, Gu. "China’s Search for Complete Separability of the Arbitral Agreement." Asian International Arbitration Journal 3, Issue 2 (December 1, 2007): 163–75. http://dx.doi.org/10.54648/aiaj2007006.
Full textNeumaier, Arnold. "Complete search in continuous global optimization and constraint satisfaction." Acta Numerica 13 (May 2004): 271–369. http://dx.doi.org/10.1017/s0962492904000194.
Full textOnishi, Toshikazu, Akira Mizuno, Akiko Kawamura, Kengo Tachihara, and Yasuo Fukui. "A Complete Search for Dense Cloud Cores in Taurus." Astrophysical Journal 575, no. 2 (August 20, 2002): 950–73. http://dx.doi.org/10.1086/341347.
Full textFoertsch, Julie, and Morton Ann Gernsbacher. "In search of complete comprehension: Getting “minimalists” to work." Discourse Processes 18, no. 3 (November 1994): 271–96. http://dx.doi.org/10.1080/01638539409544896.
Full textVitek, O., C. Bailey-Kellogg, B. Craig, P. Kuliniewicz, and J. Vitek. "Reconsidering complete search algorithms for protein backbone NMR assignment." Bioinformatics 21, Suppl 2 (September 1, 2005): ii230—ii236. http://dx.doi.org/10.1093/bioinformatics/bti1138.
Full textGuo, Wen-Sheng, Guo-Wu Yang, William N. N. Hung, and Xiaoyu Song. "Complete Boolean Satisfiability Solving Algorithms Based on Local Search." Journal of Computer Science and Technology 28, no. 2 (March 2013): 247–54. http://dx.doi.org/10.1007/s11390-013-1326-4.
Full textLöser, Alexander, Christoph Nagel, Stephan Pieper, and Christoph Boden. "Beyond search: Retrieving complete tuples from a text-database." Information Systems Frontiers 15, no. 3 (January 23, 2013): 311–29. http://dx.doi.org/10.1007/s10796-012-9403-8.
Full textFickert, Maximilian, and Joerg Hoffmann. "Complete Local Search: Boosting Hill-Climbing through Online Relaxation Refinement." Proceedings of the International Conference on Automated Planning and Scheduling 27 (June 5, 2017): 107–15. http://dx.doi.org/10.1609/icaps.v27i1.13801.
Full textBrowne, I. W. A., and S. T. Myers. "The CLASS Gravitational Lens Search." Symposium - International Astronomical Union 201 (2005): 443–44. http://dx.doi.org/10.1017/s0074180900216586.
Full textHUANG, GENG-DIAN, and BOW-YAW WANG. "COMPLETE SAT-BASED MODEL CHECKING FOR CONTEXT-FREE PROCESSES." International Journal of Foundations of Computer Science 21, no. 02 (April 2010): 115–34. http://dx.doi.org/10.1142/s0129054110007179.
Full textMarinescu, Radu, Junkyu Lee, Rina Dechter, and Alexander Ihler. "AND/OR Search for Marginal MAP." Journal of Artificial Intelligence Research 63 (December 22, 2018): 875–921. http://dx.doi.org/10.1613/jair.1.11265.
Full textStiffler, Nicholas M., and Jason M. O’Kane. "Complete and optimal visibility-based pursuit-evasion." International Journal of Robotics Research 36, no. 8 (July 2017): 923–46. http://dx.doi.org/10.1177/0278364917711535.
Full textYAMAGISHI, Yuki, Kazuo AOYAMA, Kazumi SAITO, and Tetsuo IKEDA. "Efficient Similarity Search with a Pivot-Based Complete Binary Tree." IEICE Transactions on Information and Systems E100.D, no. 10 (2017): 2526–36. http://dx.doi.org/10.1587/transinf.2017edp7100.
Full textBadaloni, Silvana, Francesco Sambo, and Francesco Venco. "Bayesian Network structure learning: Hybridizing complete search with independence tests." AI Communications 28, no. 2 (2015): 309–22. http://dx.doi.org/10.3233/aic-140634.
Full textOBA, Risaburo. "Several Trials in the Search for a Complete Cavitation Concept." JSME international journal. Ser. 2, Fluids engineering, heat transfer, power, combustion, thermophysical properties 33, no. 4 (1990): 621–28. http://dx.doi.org/10.1299/jsmeb1988.33.4_621.
Full textCOURTNEY, ALAN J., and LIPING GUAN. "Visual search performance with complete and incomplete visual lobe areas." Ergonomics 39, no. 5 (May 1996): 749–56. http://dx.doi.org/10.1080/00140139608964496.
Full textGrover, Lov K. "Local search and the local structure of NP-complete problems." Operations Research Letters 12, no. 4 (October 1992): 235–43. http://dx.doi.org/10.1016/0167-6377(92)90049-9.
Full textXue, Yuan, Boting Yang, Farong Zhong, and Sandra Zilles. "The Fast Search Number of a Complete k-Partite Graph." Algorithmica 80, no. 12 (May 21, 2018): 3959–81. http://dx.doi.org/10.1007/s00453-018-0456-z.
Full textBrandão, Filipe, and João Pedro Pedroso. "A complete search method for the relaxed traveling tournament problem." EURO Journal on Computational Optimization 2, no. 1-2 (April 30, 2013): 77–86. http://dx.doi.org/10.1007/s13675-013-0010-3.
Full textIsmail, Yasser. "A Complete Verification of a Full Search Motion Estimation Engine." International Journal of Computing and Digital Systems 4, no. 4 (October 1, 2015): 221–32. http://dx.doi.org/10.12785/ijcds/040401.
Full textHolbreich, Mark. "In search of Eosinophilic Esophagitis: Adding a complete eating history." Annals of Allergy, Asthma & Immunology 124, no. 3 (March 2020): 288. http://dx.doi.org/10.1016/j.anai.2019.12.009.
Full textKhan, Amna, Iram Noreen, Hyejeong Ryu, Nakju Lett Doh, and Zulfiqar Habib. "Online complete coverage path planning using two-way proximity search." Intelligent Service Robotics 10, no. 3 (March 16, 2017): 229–40. http://dx.doi.org/10.1007/s11370-017-0223-z.
Full textWeikert, Dominik, Sebastian Mai, and Sanaz Mostaghim. "Particle Swarm Contour Search Algorithm." Entropy 22, no. 4 (April 2, 2020): 407. http://dx.doi.org/10.3390/e22040407.
Full textGautier, Pieter A., and Christian L. Holzner. "Simultaneous Search and Efficiency of Entry and Search Intensity." American Economic Journal: Microeconomics 9, no. 3 (August 1, 2017): 245–82. http://dx.doi.org/10.1257/mic.20160088.
Full textSavkin, Andrey V., and Hang Li. "A safe area search and map building algorithm for a wheeled mobile robot in complex unknown cluttered environments." Robotica 36, no. 1 (April 10, 2017): 96–118. http://dx.doi.org/10.1017/s0263574717000194.
Full textKraus-Friedberg, Chana. "MEDLINE Complete." Charleston Advisor 22, no. 3 (January 1, 2021): 33–35. http://dx.doi.org/10.5260/chara.22.3.33.
Full textZhang, Rui, and Tian Chen. "Fast quantum search driven by environmental engineering." Communications in Theoretical Physics 74, no. 4 (April 1, 2022): 045101. http://dx.doi.org/10.1088/1572-9494/ac539d.
Full textHendricks, Kenneth, Alan Sorensen, and Thomas Wiseman. "Observational Learning and Demand for Search Goods." American Economic Journal: Microeconomics 4, no. 1 (February 1, 2012): 1–31. http://dx.doi.org/10.1257/mic.4.1.1.
Full textHernandez, Carlos, Jorge Baier, Tansel Uras, and Sven Koenig. "Paper Summary: Time-Bounded Adaptive A*." Proceedings of the International Symposium on Combinatorial Search 3, no. 1 (August 20, 2021): 184–85. http://dx.doi.org/10.1609/socs.v3i1.18228.
Full textMukherjee, Rohan, Swarat Chaudhuri, and Chris Jermaine. "Searching a database of source codes using contextualized code search." Proceedings of the VLDB Endowment 13, no. 10 (June 2020): 1765–78. http://dx.doi.org/10.14778/3401960.3401972.
Full textLach, Helen W. "SELF-EFFICACY AND FEAR OF FALLING: IN SEARCH OF COMPLETE THEORY." Journal of the American Geriatrics Society 54, no. 2 (February 2006): 381–82. http://dx.doi.org/10.1111/j.1532-5415.2005.00592_11_1.x.
Full textHemann, Jason, Daniel P. Friedman, William E. Byrd, and Matthew Might. "A small embedding of logic programming with a simple complete search." ACM SIGPLAN Notices 52, no. 2 (May 11, 2017): 96–107. http://dx.doi.org/10.1145/3093334.2989230.
Full textKube, Paul R. "Unbounded visual search is not both biologically plausible and NP - Complete." Behavioral and Brain Sciences 14, no. 4 (December 1991): 768–70. http://dx.doi.org/10.1017/s0140525x00072472.
Full textDivecha, Jyoti. "Search for suitable incomplete block designs for complete diallel cross systems." Journal of Applied Statistics 27, no. 1 (January 2000): 49–62. http://dx.doi.org/10.1080/02664760021826.
Full textCrespelle, Christophe, and Philippe Gambette. "Unrestricted and complete Breadth-First Search of trapezoid graphs in time." Information Processing Letters 110, no. 12-13 (June 2010): 497–502. http://dx.doi.org/10.1016/j.ipl.2010.03.015.
Full textDavydov, Alexander A., Giorgio Faina, Stefano Marcugini, and Fernanda Pambianco. "Computer search in projective planes for the sizes of complete arcs." Journal of Geometry 82, no. 1-2 (August 2005): 50–62. http://dx.doi.org/10.1007/s00022-004-1719-1.
Full textEnkin, Murray, and Jini Hetherington. "Collecting the Evidence Systematically: Ensuring That It Is Complete and Up-to-Date." International Journal of Technology Assessment in Health Care 12, no. 2 (1996): 276–79. http://dx.doi.org/10.1017/s0266462300009624.
Full textChen, Siyi, Lucas Schnabl, Hermann J. Müller, and Markus Conci. "Amodal Completion of a Target Template Enhances Attentional Guidance in Visual Search." i-Perception 9, no. 4 (July 2018): 204166951879624. http://dx.doi.org/10.1177/2041669518796240.
Full textGavazzoni, Alessandro, Francisco Rosso Júnior, and Jefferson Ricardo Pereira. "Immediate complete denture: a contemporary view." Journal of Research in Dentistry 3, no. 2 (October 13, 2015): 646. http://dx.doi.org/10.19177/jrd.v3e22015646-653.
Full textJordi, C., E. Trullols, D. Galadí-Enríquez, and F. Lahulla. "Cepheus OB3: Search for Faint Members." Symposium - International Astronomical Union 164 (1995): 376. http://dx.doi.org/10.1017/s0074180900108940.
Full textVasquez, Michel, and Nicolas Zufferey. "Consistent Neighborhood Search for Combinatorial Optimization." ISRN Computational Mathematics 2012 (September 13, 2012): 1–12. http://dx.doi.org/10.5402/2012/671423.
Full textZhang, Jin, Xin Cai, Taowen Le, Wei Fei, and Feicheng Ma. "A Study on Effective Measurement of Search Results from Search Engines." Journal of Global Information Management 27, no. 1 (January 2019): 196–221. http://dx.doi.org/10.4018/jgim.2019010110.
Full textLuna, Ryan, and Kostas Bekris. "Efficient and Complete Centralized Multi-Robot Path Planning." Proceedings of the International Symposium on Combinatorial Search 2, no. 1 (August 19, 2021): 201–2. http://dx.doi.org/10.1609/socs.v2i1.18209.
Full textMedi, Alexandre, Tenda Okimoto, and Katsumi Inoue. "A Two-Phase Complete Algorithm for Multi-Objective Distributed Constraint Optimization." Journal of Advanced Computational Intelligence and Intelligent Informatics 18, no. 4 (July 20, 2014): 573–80. http://dx.doi.org/10.20965/jaciii.2014.p0573.
Full text