Relevant bibliographies by topics / Complete search

Academic literature on the topic 'Complete search'

Author: Grafiati
Published: 4 June 2021
Last updated: 20 February 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Complete search"

1

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 text
APA, Harvard, Vancouver, ISO, and other styles
2

Mai, 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
APA, Harvard, Vancouver, ISO, and other styles
3

�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 text
APA, Harvard, Vancouver, ISO, and other styles
4

GREENLAW, 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 text
Abstract:
The parallel complexity of a search strategy that combines attributes of both breadth-first search and depth-first search is studied. The search called breadth-depth search was defined by Horowitz and Sahni. The search technique has applications in branch-and-bound strategies. Kindervater and Lenstra posed the complexity of this type of search strategy as an open problem. We resolve their question by showing that a natural decision problem based on breadth-depth search is [Formula: see text]-complete. Specifically, we prove that if given a graph G=(V, E) either directed or undirected, a start vertex s∈V, and two designated vertices u and v in V, then the problem of deciding whether u is visited before v by a breadth-depth search originating from s is [Formula: see text]-complete. The search can be based either on vertex numbers or fixed ordered adjacency lists. Our reductions differ for directed/undirected graphs and depending on whether vertex numbers/fixed ordered adjacency lists are used. These results indicate breadth-depth search is highly sequential in nature and probably will not adapt to a fast parallel solution, unless [Formula: see text] equals [Formula: see text].
APA, Harvard, Vancouver, ISO, and other styles
5

John, 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 text
Abstract:
In portfolio optimization, the fundamental goal of an investor is to optimally allocate investments between different assets. Mean-variance optimization methods make unrealistic assumptions to solve the problem of optimal allocation. On the other hand, when realistic constraints like holding size and cardinality are introduced it leads to optimal asset allocation which differ from the mean variance optimization. The resulting optimization problem become quite complex as it exhibits multiple local extrema and discontinuities. Heuristic algorithms work well for the complex problem. Therefore, a heuristic algorithm is developed which is based on hill climbing complete (HC-C). It is utilized to solve the extended portfolio optimization problem. In order to validate its performance, the proposed HC-C is tested with standard portfolio optimization problem. Experimental results are benchmarked with the quadratic programming method and threshold accepting (TA) algorithm.
APA, Harvard, Vancouver, ISO, and other styles
6

Pollmann, 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 text
APA, Harvard, Vancouver, ISO, and other styles
7

Weixia, 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 text
APA, Harvard, Vancouver, ISO, and other styles
8

Neumaier, 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 text
APA, Harvard, Vancouver, ISO, and other styles
9

Onishi, 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 text
APA, Harvard, Vancouver, ISO, and other styles
10

Foertsch, 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 text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Complete search"

1

Ferreira, Junior Valnir, and N/A. "Improvements to Clause Weighting Local Search for Propositional Satisfiability." Griffith University. Institute for Integrated and Intelligent Systems, 2007. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20070823.123257.

Full text
Abstract:
The propositional satisfiability (SAT) problem is of considerable theoretical and practical relevance to the artificial intelligence (AI) community and has been used to model many pervasive AI tasks such as default reasoning, diagnosis, planning, image interpretation, and constraint satisfaction. Computational methods for SAT have historically fallen into two broad categories: complete search and local search. Within the local search category, clause weighting methods are amongst the best alternatives for SAT, becoming particularly attractive on problems where a complete search is impractical or where there is a need to find good candidate solutions within a short time. The thesis is concerned with the study of improvements to clause weighting local search methods for SAT. The main contributions are: A component-based framework for the functional analysis of local search methods. A clause weighting local search heuristic that exploits longer-term memory arising from clause weight manipulations. The approach first learns which clauses are globally hardest to satisfy and then uses this information to treat these clauses differentially during weight manipulation [Ferreira Jr and Thornton, 2004]. A study of heuristic tie breaking in the domain of additive clause weighting local search methods, and the introduction of a competitive method that uses heuristic tie breaking instead of the random tie breaking approach used in most existing methods [Ferreira Jr and Thornton, 2005]. An evaluation of backbone guidance for clause weighting local search, and the introduction of backbone guidance to three state-of-the-art clause weighting local search methods [Ferreira Jr, 2006]. A new clause weighting local search method for SAT that successfully exploits synergies between the longer-term memory and tie breaking heuristics developed in the thesis to significantly improve on the performance of current state-of-the-art local search methods for SAT-encoded instances containing identifiable CSP structure. Portions of this thesis have appeared in the following refereed publications: Longer-term memory in clause weighting local search for SAT. In Proceedings of the 17th Australian Joint Conference on Artificial Intelligence, volume 3339 of Lecture Notes in Artificial Intelligence, pages 730-741, Cairns, Australia, 2004. Tie breaking in clause weighting local search for SAT. In Proceedings of the 18th Australian Joint Conference on Artificial Intelligence, volume 3809 of Lecture Notes in Artificial Intelligence, pages 70–81, Sydney, Australia, 2005. Backbone guided dynamic local search for propositional satisfiability. In Proceedings of the Ninth International Symposium on Artificial Intelligence and Mathematics, AI&M, Fort Lauderdale, Florida, 2006.
APA, Harvard, Vancouver, ISO, and other styles
2

Ferreira, Junior Valnir. "Improvements to Clause Weighting Local Search for Propositional Satisfiability." Thesis, Griffith University, 2007. http://hdl.handle.net/10072/365857.

Full text
Abstract:
The propositional satisfiability (SAT) problem is of considerable theoretical and practical relevance to the artificial intelligence (AI) community and has been used to model many pervasive AI tasks such as default reasoning, diagnosis, planning, image interpretation, and constraint satisfaction. Computational methods for SAT have historically fallen into two broad categories: complete search and local search. Within the local search category, clause weighting methods are amongst the best alternatives for SAT, becoming particularly attractive on problems where a complete search is impractical or where there is a need to find good candidate solutions within a short time. The thesis is concerned with the study of improvements to clause weighting local search methods for SAT. The main contributions are: A component-based framework for the functional analysis of local search methods. A clause weighting local search heuristic that exploits longer-term memory arising from clause weight manipulations. The approach first learns which clauses are globally hardest to satisfy and then uses this information to treat these clauses differentially during weight manipulation [Ferreira Jr and Thornton, 2004]. A study of heuristic tie breaking in the domain of additive clause weighting local search methods, and the introduction of a competitive method that uses heuristic tie breaking instead of the random tie breaking approach used in most existing methods [Ferreira Jr and Thornton, 2005]. An evaluation of backbone guidance for clause weighting local search, and the introduction of backbone guidance to three state-of-the-art clause weighting local search methods [Ferreira Jr, 2006]. A new clause weighting local search method for SAT that successfully exploits synergies between the longer-term memory and tie breaking heuristics developed in the thesis to significantly improve on the performance of current state-of-the-art local search methods for SAT-encoded instances containing identifiable CSP structure. Portions of this thesis have appeared in the following refereed publications: Longer-term memory in clause weighting local search for SAT. In Proceedings of the 17th Australian Joint Conference on Artificial Intelligence, volume 3339 of Lecture Notes in Artificial Intelligence, pages 730-741, Cairns, Australia, 2004. Tie breaking in clause weighting local search for SAT. In Proceedings of the 18th Australian Joint Conference on Artificial Intelligence, volume 3809 of Lecture Notes in Artificial Intelligence, pages 70–81, Sydney, Australia, 2005. Backbone guided dynamic local search for propositional satisfiability. In Proceedings of the Ninth International Symposium on Artificial Intelligence and Mathematics, AI&M, Fort Lauderdale, Florida, 2006.
Thesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Institute for Integrated and Intelligent Systems
Full Text
APA, Harvard, Vancouver, ISO, and other styles
3

McGowan, Robert. "A Search for Understanding Why Male, Long Term High School Dropouts Resist Returning to Complete a Secondary Credential." Thesis, University of Arkansas, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3702758.

Full text
Abstract:

Much of the resistance for returning to education seems to be related to the same reasons students left school to begin with. The reason for dropping out and resisting to return to school may be a result of too much emphasis on academic preparation and too little emphasis on satisfying the perceived needs for preparing a youth for adulthood. Four themes emerged from the field-note based interviews: (1) all students do not learn the same way, (2) there is a need for more participatory learning, (3) learning should be relevant to life as perceived by the student, and (4) there is a dislike of computer content that is not supported by personal instruction. While these themes are supportive of past research efforts and may not seem remarkable, the solutions offered by the participants to improve these problems are worthy of consideration, and may be of use to both secondary and adult education.

APA, Harvard, Vancouver, ISO, and other styles
4

Cowhig, Patrick Carpenter. "A Complete & Practical Approach to Ensure the Legality of a Signal Transmitted by a Cognitive Radio." Thesis, Virginia Tech, 2006. http://hdl.handle.net/10919/34969.

Full text
Abstract:
The computational power and algorithms needed to create a cognitive radio are quickly becoming available. There are many advantages to having a radio operated by cognitive engine, and so cognitive radios are likely to become very popular in the future. One of the main difficulties associated with the cognitive radio is ensuring the signal transmitted will follow all FCC rules. The work presented in this thesis provides a methodology to guarantee that all signals will be legal and valid. The first part to achieving this is a practical and easy to use software testing program based on the tabu search algorithm that tests the software off-line. The primary purpose of the software testing program is to find most of the errors, specially structural errors, while the radio is not in use so that it does not affect the performance of the system. The software testing program does not provide a complete assurance that no errors exist, so to supplement this deficit, a built-in self-test (BIST) is employed. The BIST is designed with two parts, one that is embedded into the cognitive engine and one that is placed into the radio's API. These two systems ensure that all signals transmitted by the cognitive radio will follow FCC rules while consuming a minimal amount of computational power. The software testing approach based on the tabu search is shown to be a viable method to test software with improved results over previous methods. Also, the software BIST demonstrated its ability to find errors in the signal production and is dem to only require an insignificant amount of computational power. Overall, the methods presented in this paper provide a complete and practical approach to assure the FCC of the legality of all signals in order to obtain a license for the product.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
5

Simões, Manuel Areias Sobrinho. "In search of the original leukemic clone in chronic myeloid leukemia patients in complete molecular remission after stem cell transplantation or imatinib." Doctoral thesis, Faculdade de Medicina da Universidade do Porto, 2010. http://hdl.handle.net/10216/56734.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Simões, Manuel Areias Sobrinho. "In search of the original leukemic clone in chronic myeloid leukemia patients in complete molecular remission after stem cell transplantation or imatinib." Tese, Faculdade de Medicina da Universidade do Porto, 2010. http://hdl.handle.net/10216/56734.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Jurčík, Lukáš. "Evoluční algoritmy při řešení problému obchodního cestujícího." Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2014. http://www.nusl.cz/ntk/nusl-224447.

Full text
Abstract:
This diploma thesis deals with evolutionary algorithms used for travelling salesman problem (TSP). In the first section, there are theoretical foundations of a graph theory and computational complexity theory. Next section contains a description of chosen optimization algorithms. The aim of the diploma thesis is to implement an application that solve TSP using evolutionary algorithms.
APA, Harvard, Vancouver, ISO, and other styles
8

Eyono, Obono Séraphin Désiré. "Recherche efficace d'images morphiques de mots." Rouen, 1995. http://www.theses.fr/1995ROUE5014.

Full text
Abstract:
Nous étudions dans cette thèse la recherche d'un motif homomorphe dans un texte et montrons que ce problème est NP-complet. Nous établissons une première classification des motifs: les motifs simples (ou motifs élémentaires) et les motifs non simples. Nous donnons une caractérisation de la rationalité des motifs simples. Nous proposons ensuite une classification des motifs simples selon leurs degrés, ainsi qu'un algorithme efficace de recherche dans un texte des images de tout motif de degré un ou deux, qui fait gagner, ou presque gagner, un ou deux degrés de complexité par rapport à l'algorithme naïf que nous présentons également. Nous proposons enfin une généralisation de cet algorithme à toute classe de motifs de degré supérieur ou égal à deux. Nous nous inspirons du cas de la classe des motifs de degré un pour proposer un algorithme efficace de résolution des équations aux mots à une variable
APA, Harvard, Vancouver, ISO, and other styles
9

Kopřiva, Jan. "Srovnání algoritmů při řešení problému obchodního cestujícího." Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2009. http://www.nusl.cz/ntk/nusl-222126.

Full text
Abstract:
The Master Thesis deals with logistic module innovation of information system ERP. The principle of innovation is based on implementation of heuristic algorithms which solve Travel Salesman Problems (TSP). The software MATLAB is used for analysis and tests of these algorithms. The goal of Master Thesis is the comparison of selections algorithm, which are suitable for economic purposes (accuracy of solution, speed of calculation and memory demands).
APA, Harvard, Vancouver, ISO, and other styles
10

Arendt, Dustin Lockhart. "In Search of Self-Organization." Diss., Virginia Tech, 2012. http://hdl.handle.net/10919/26465.

Full text
Abstract:
Many who study complex systems believe that the complexity we observe in the world around us is frequently the product of a large number of interactions between components following a simple rule. However, the task of discerning the rule governing the evolution of any given system is often quite difficult, requiring intuition, guesswork, and a great deal of expertise in that domain. To circumvent this issue, researchers have considered the inverse problem where one searches among many candidate rules to reveal those producing interesting behavior. This approach has its own challenges because the search space grows exponentially and interesting behavior is rare and difficult to rigorously define. Therefore, the contribution of this work includes tools and techniques for searching for dimer automaton rules that exhibit self-organization (the transformation of disorder into structure in the absence of centralized control). Dimer automata are simple, discrete, asynchronous rewriting systems that operate over the edges of an arbitrary graph. Specifically, these contributions include a number of novel, surprising, and useful applications of dimer automata, practical methods for measuring self-organization, advanced techniques for searching for dimer automaton rules, and two efficient GPU parallelizations of dimer automata to make searching and simulation more tractable.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Complete search"

1

The complete search committee guidebook. Ventura, Calif., U.S.A: Regal Books, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

The new complete job search. New York: Wiley, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Beatty, Richard H. The complete job search book. New York: Wiley, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

The complete idiot's guide to online search secrets. Indianapolis, IN: Que, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

The complete idiot's guide to search engine optimization. Indianapolis, IN: Alpha Books, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

The complete idiot's guide to Yahoo! Indianapolis, IN: Que, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Samuel, Wendy. Fashion careers: The complete job search workbook. [United States?: s.n., 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gavranović, Zvonimir. In search of Cardinal Stepinac: A complete biography. Zagreb: Kršćanska sadašnjost, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lang, Adams Robert, ed. The complete job search book for college students. 3rd ed. Avon, Mass: Adams Media, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sinicki, Adam. The Complete Beginner’s Guide to Search Engine Optimization. Berkeley, CA: Apress, 2018. http://dx.doi.org/10.1007/978-1-4842-3635-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Complete search"

1

Bonds, Roger G., and Neil Baum. "Job Search." In The Complete Business Guide for a Successful Medical Practice, 29–45. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11095-0_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Prestwich, Steven. "The Relation Between Complete and Incomplete Search." In Hybrid Metaheuristics, 63–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-78295-7_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Shen, Haiou, and Hantao Zhang. "Another Complete Local Search Method for SAT." In Logic for Programming, Artificial Intelligence, and Reasoning, 595–605. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11591191_41.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Björdal, Gustav, Pierre Flener, and Justin Pearson. "Generating Compound Moves in Local Search by Hybridisation with Complete Search." In Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 95–111. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-19212-9_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lynce, Inês, Luís Baptista, and João Marques-Silva. "Towards Provably Complete Stochastic Search Algorithms for Satisfiability." In Progress in Artificial Intelligence, 363–70. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45329-6_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gascó, Guillem, Joan-Andreu Sánchez, and José-Miguel Benedí. "Complete Search Space Exploration for SITG Inside Probability." In Lecture Notes in Computer Science, 306–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14980-1_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bodewig, Michael. "Multiplied Complete Fix-Free Codes and Shiftings Regarding the 3/4-Conjecture." In Information Theory, Combinatorics, and Search Theory, 694–710. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36899-8_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ferreira, Afonso G. "Parallel Search in Sorted Multisets, and NP-Complete Problems." In Computer Science, 383–93. Boston, MA: Springer US, 1992. http://dx.doi.org/10.1007/978-1-4615-3422-8_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wallner, Michael. "In Search of a Structurally Complete Epistemology of Essence." In Epistemology of Modality and Philosophical Methodology, 150–75. New York: Routledge, 2023. http://dx.doi.org/10.4324/9781003002192-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Moultrie, Tom A. "A Case of An Almost Complete Demographic Transition: South Africa." In Africa's Population: In Search of a Demographic Dividend, 87–99. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-46889-1_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Complete search"

1

Tibau, Marcelo, Sean Wolfgand Matsui Siqueira, and Bernardo Pereira Nunes. "Understanding Web Search Patterns Through Exploratory Search as a Knowledge-intensive Proces." In Simpósio Brasileiro de Sistemas de Informação. Sociedade Brasileira de Computação (SBC), 2020. http://dx.doi.org/10.5753/sbsi.2020.13131.

Full text
Abstract:
To better understand users’ intent, Web search engines need to transcend its information sorter utility and acquire a more relevant ability concerning semantics’ discernment. This master thesis presents the Exploratory Search KiP model, which helps clarify the reasons why a subject is searched and supports the visualization of decision criteria used for choosing a specific search result. It also introduces the ESKiP Taxonomy of Query States; a classification framework that helps to represent the structure and behavior of query reformulation in search systems. As a result, the artifacts allowed to identify Web search and query reformulation patterns. The Exploratory Search KiP model also aided to distinguish three main behaviors involved in exploratory searches: (1) The ability to increase the level of familiarity with the topic and content searched (topic familiarity); (2) The ability to control the search process itself; and (3) The ability to assess the retrieved information relevance. For further reading: [Dias 2019] at UNIRIO’s repository. A summary article from the complete work was submitted to an international Information System Journal and is currently under review
APA, Harvard, Vancouver, ISO, and other styles
2

Spencer, K. L., Fung Ho-fung Leung, and J. H. M. Lee. "Guided complete search for nurse rostering problems." In 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05). IEEE, 2005. http://dx.doi.org/10.1109/ictai.2005.70.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bast, Holger, Debapriyo Majumdar, and Ingmar Weber. "Efficient interactive query expansion with complete search." In the sixteenth ACM conference. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/1321440.1321560.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Balkcom, Devin, Ajay Kannan, Yu-Han Lyu, Weifu Wang, and Yinan Zhang. "Metric cells: Towards complete search for optimal trajectories." In 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2015. http://dx.doi.org/10.1109/iros.2015.7354072.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

"Complete Distributed Search Algorithm for Cyclic Factor Graphs." In International Conference on Agents and Artificial Intelligence. SCITEPRESS - Science and and Technology Publications, 2014. http://dx.doi.org/10.5220/0004824301840192.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Minka, Thomas P., Dan S. Bloomberg, and Kris Popat. "Document image decoding using iterated complete path search." In Photonics West 2001 - Electronic Imaging, edited by Paul B. Kantor, Daniel P. Lopresti, and Jiangying Zhou. SPIE, 2000. http://dx.doi.org/10.1117/12.410843.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

MacAvaney, Sean. "OpenNIR: A Complete Neural Ad-Hoc Ranking Pipeline." In WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3336191.3371864.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Löser, Alexander, Christoph Nagel, Stephan Pieper, and Christoph Boden. "Self-supervised web search for any-k complete tuples." In the 2nd International Workshop. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1966883.1966889.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

You, Hojun, and Chongam Kim. "Complete-search Tensor Contractions for Optimizing High-order Methods." In AIAA Scitech 2020 Forum. Reston, Virginia: American Institute of Aeronautics and Astronautics, 2020. http://dx.doi.org/10.2514/6.2020-0809.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Aziz G. Mabaning, Abdul, and Jordan Rel C. Orillaza. "Complete solution of optimal PMU placement using reduced exhaustive search." In 2016 IEEE Region 10 Conference (TENCON). IEEE, 2016. http://dx.doi.org/10.1109/tencon.2016.7848119.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Complete search"

1

Paynter, Robin A., Celia Fiordalisi, Elizabeth Stoeger, Eileen Erinoff, Robin Featherstone, Christiane Voisin, and Gaelen P. Adam. A Prospective Comparison of Evidence Synthesis Search Strategies Developed With and Without Text-Mining Tools. Agency for Healthcare Research and Quality (AHRQ), March 2021. http://dx.doi.org/10.23970/ahrqepcmethodsprospectivecomparison.

Full text
Abstract:
Background: In an era of explosive growth in biomedical evidence, improving systematic review (SR) search processes is increasingly critical. Text-mining tools (TMTs) are a potentially powerful resource to improve and streamline search strategy development. Two types of TMTs are especially of interest to searchers: word frequency (useful for identifying most used keyword terms, e.g., PubReminer) and clustering (visualizing common themes, e.g., Carrot2). Objectives: The objectives of this study were to compare the benefits and trade-offs of searches with and without the use of TMTs for evidence synthesis products in real world settings. Specific questions included: (1) Do TMTs decrease the time spent developing search strategies? (2) How do TMTs affect the sensitivity and yield of searches? (3) Do TMTs identify groups of records that can be safely excluded in the search evaluation step? (4) Does the complexity of a systematic review topic affect TMT performance? In addition to quantitative data, we collected librarians' comments on their experiences using TMTs to explore when and how these new tools may be useful in systematic review search¬¬ creation. Methods: In this prospective comparative study, we included seven SR projects, and classified them into simple or complex topics. The project librarian used conventional “usual practice” (UP) methods to create the MEDLINE search strategy, while a paired TMT librarian simultaneously and independently created a search strategy using a variety of TMTs. TMT librarians could choose one or more freely available TMTs per category from a pre-selected list in each of three categories: (1) keyword/phrase tools: AntConc, PubReMiner; (2) subject term tools: MeSH on Demand, PubReMiner, Yale MeSH Analyzer; and (3) strategy evaluation tools: Carrot2, VOSviewer. We collected results from both MEDLINE searches (with and without TMTs), coded every citation’s origin (UP or TMT respectively), deduplicated them, and then sent the citation library to the review team for screening. When the draft report was submitted, we used the final list of included citations to calculate the sensitivity, precision, and number-needed-to-read for each search (with and without TMTs). Separately, we tracked the time spent on various aspects of search creation by each librarian. Simple and complex topics were analyzed separately to provide insight into whether TMTs could be more useful for one type of topic or another. Results: Across all reviews, UP searches seemed to perform better than TMT, but because of the small sample size, none of these differences was statistically significant. UP searches were slightly more sensitive (92% [95% confidence intervals (CI) 85–99%]) than TMT searches (84.9% [95% CI 74.4–95.4%]). The mean number-needed-to-read was 83 (SD 34) for UP and 90 (SD 68) for TMT. Keyword and subject term development using TMTs generally took less time than those developed using UP alone. The average total time was 12 hours (SD 8) to create a complete search strategy by UP librarians, and 5 hours (SD 2) for the TMT librarians. TMTs neither affected search evaluation time nor improved identification of exclusion concepts (irrelevant records) that can be safely removed from the search set. Conclusion: Across all reviews but one, TMT searches were less sensitive than UP searches. For simple SR topics (i.e., single indication–single drug), TMT searches were slightly less sensitive, but reduced time spent in search design. For complex SR topics (e.g., multicomponent interventions), TMT searches were less sensitive than UP searches; nevertheless, in complex reviews, they identified unique eligible citations not found by the UP searches. TMT searches also reduced time spent in search strategy development. For all evidence synthesis types, TMT searches may be more efficient in reviews where comprehensiveness is not paramount, or as an adjunct to UP for evidence syntheses, because they can identify unique includable citations. If TMTs were easier to learn and use, their utility would be increased.
APA, Harvard, Vancouver, ISO, and other styles
2

Gupta, Aditya, Deanna Hall, and Aaron Simkovich. How effective are devices in the management of Onychomycosis? A protocol for a systematic review. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, November 2021. http://dx.doi.org/10.37766/inplasy2021.11.0069.

Full text
Abstract:
Review question / Objective: To compile evidence and determine the utility of various device-based treatments for the treatment of onychomycosis, and improve the appearance of afflicted toenails. Condition being studied: Toenail onychomycosis, also known as tinea unguium. Information sources: A systematic literature search will be conducted in Scopus, MEDLINE and PubMed. The bibliographies of relevant articles will also be searched to ensure a comprehensive review is presented. Clinical trial registries (such as clinicaltrials.gov) will also be searched for complete, or incomplete trials.
APA, Harvard, Vancouver, ISO, and other styles
3

Knox, Sally, Kïrsten Way, and Alex Haslam. Are identity leadership and shared social identity associated with the highly reliable behaviour of military personnel? Protocol for a systematic review. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, May 2022. http://dx.doi.org/10.37766/inplasy2022.5.0063.

Full text
Abstract:
Review question / Objective: Are identity leadership and shared social identity associated with the highly reliable behaviour of military personnel? Information sources: Searches will be conducted in the following databases: PsychInfo, Web of Sciences, Proquest Social Science Database, PTSDpubs, PubMed, Business Source Complete, and SCOPUS. To ensure literature saturation, the eligible papers and reviews identified through the search will be used for reference mining. A bibliography of the eligible papers will be circulated to the systematic review team and social identity experts identified by the team to ensure all relevant material has been captured.
APA, Harvard, Vancouver, ISO, and other styles
4

Alqarawi, Nada, and Eman Alhalal. A systematic review of factors affecting the delivery of family-centered care by nurses. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, February 2023. http://dx.doi.org/10.37766/inplasy2023.2.0074.

Full text
Abstract:
Review question / Objective: The Review Question of this systematic review will be: - what are the factors associated with delivering family-centered care to ill children by nurses? This study will follow PECOS P Nurses providing care to ill children E Factors that influence family-centered care (exposure). (Individual factors, organizational factors, and family factors). C Not applicable O Delivering family-centered care S Mixed study designs (quantitative and qualitative). Information sources: Search strategies will conduct through electronic databases: PubMed, MEDLINE Complete, CINAHL Complete, ProQuest (Nursing and Allied Health, and Web of Science databases.
APA, Harvard, Vancouver, ISO, and other styles
5

Lin, Zhijuan, Xing Chen, Long Liu, Zhifeng Li, and Bing Xu. Chemo-Free Treatments in Relapsed and/or Refractory Follicular Lymphoma: A Network Meta-Analysis. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, November 2021. http://dx.doi.org/10.37766/inplasy2021.11.0111.

Full text
Abstract:
Review question / Objective: FL is the most common indolent B cell lymphoma worldwide and patients with FL always have long term survival. However, advanced FL remains incurable and there is no universal agreement on optimal regimen to manage relapsed FL. Condition being studied: The efficacy of chemo-free regimens, including CD20 antibodies and targeted agents, in relapsed and/or refractory Follicular lymphoma. Information sources: We used the MEDLINE, Embase, and Cochrane Library databases to search the RCTs met our selection criteria. We also searched clinicalTrials.gov and the international clinical trial registry platform for completed and ongoing trials. In addition, we searched abstracts that published on American Society of Hematology (ASH), The European Hematology Association (EHA) or American Society of Clinical Oncology (ASCO) meetings.
APA, Harvard, Vancouver, ISO, and other styles
6

Wenren, Yonghu, Joon Lim, Luke Allen, Robert Haehnel, and Ian Dettwiler. Helicopter rotor blade planform optimization using parametric design and multi-objective genetic algorithm. Engineer Research and Development Center (U.S.), December 2022. http://dx.doi.org/10.21079/11681/46261.

Full text
Abstract:
In this paper, an automated framework is presented to perform helicopter rotor blade planform optimization. This framework contains three elements, Dakota, ParBlade, and RCAS. These elements are integrated into an environment control tool, Galaxy Simulation Builder, which is used to carry out the optimization. The main objective of this work is to conduct rotor performance design optimizations for forward flight and hover. The blade design variables manipulated by ParBlade are twist, sweep, and anhedral. The multi-objective genetic algorithm method is used in this study to search for the optimum blade design; the optimization objective is to minimize the rotor power required. Following design parameter substitution, ParBlade generates the modified blade shape and updates the rotor blade properties in the RCAS script before running RCAS. After the RCAS simulations are complete, the desired performance metrics (objectives and constraints) are extracted and returned to the Dakota optimizer. Demonstrative optimization case studies were conducted using a UH-60A main rotor as the base case. Rotor power in hover and forward flight, at advance ratio 𝜇𝜇 = 0.3, are used as objective functions. The results of this study show improvement in rotor power of 6.13% and 8.52% in hover and an advance ratio of 0.3, respectively. This configuration also yields greater reductions in rotor power for high advance ratios, e.g., 12.42% reduction at 𝜇𝜇 = 0.4.
APA, Harvard, Vancouver, ISO, and other styles
7

Poggio, Tomaso, and Gabriel Kreiman. Biologically Inspired Circuits for Visual Search and Recognition in Complex Scenes. Fort Belvoir, VA: Defense Technical Information Center, February 2013. http://dx.doi.org/10.21236/ada579012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

KellerLynn, Katie. Redwood National and State Parks: Geologic resources inventory report. National Park Service, October 2021. http://dx.doi.org/10.36967/nrr-2287676.

Full text
Abstract:
Comprehensive park management to fulfill the NPS mission requires an accurate inventory of the geologic features of a park unit, but Comprehensive park management to fulfill the NPS mission requires an accurate inventory of the geologic features of a park unit, but park managers may not have the needed information, geologic expertise, or means to complete such an undertaking; therefore, the Geologic Resources Inventory (GRI) provides information and resources to help park managers make decisions for visitor safety, planning and protection of infrastructure, and preservation of natural and cultural resources. Information in the GRI report may also be useful for interpretation. park managers may not have the needed information, geologic expertise, or means to complete such an undertaking; therefore, the Geologic Resources Inventory (GRI) provides information and resources to help park managers make decisions for visitor safety, planning and protection of infrastructure, and preservation of natural and cultural resources. Information in the GRI report may also be useful for interpretation. This report synthesizes discussions from a scoping meeting for Redwood National and State Parks (referred to as the “parks” throughout this report) held in 2004 and a follow-up conference call in 2019. Two GRI–compiled GIS data sets of the geology and geohazards of the parks are the principal deliverables of the GRI. The GRI GIS data are available on the GRI publications website http://go.nps.gov/gripubs and through the NPS Integrated Resource Management Applications (IRMA) portal https://irma.nps.gov/App/Portal/Home. Enter “GRI” as the search text and select a park from the unit list. Writing of this report was based on those data and the interpretations of the source map authors (see “GRI Products” and “Acknowledgements”). A geologic map poster illustrates the geology GRI GIS data set and serves as a primary figure for this GRI report. No poster was prepared for the geohazards GRI GIS data set. Additionally, figure 7 of this report illustrates the locations of the major geologic features in the parks. Unlike the poster, which is divided into a northern and southern portion to show detail while accommodating the parks’ length, figure 7 is a single-page, simplified map. The features labeled on figure 7 are discussed in the “Geologic History, Features, and Processes” chapter. To provide a context of geologic time, this report includes a geologic time scale (see "Geologic History, Features, and Processes"). The parks’ geologic story encompasses 200 million years, starting in the Jurassic Period. Following geologic practice, the time scale is set up like a stratigraphic column, with the oldest units at the bottom and the youngest units at the top. Organized in this manner, the geologic time scale table shows the relative ages of the rock units that underlie the parks and the unconsolidated deposits that lie at the surface. Reading the “Geologic Event” column in the table, from bottom to top, will provide a chronologic order of the parks’ geologic history. The time scale includes only the map units within the parks that also appear on the geologic map poster; that is, map units of the geohazards data are not included. Geology is a complex science with many specialized terms. This report provides definitions of geologic terms at first mention, typically in parentheses following the term. Geologic units in the GRI GIS data are referenced in this report using map unit symbols; for example, map unit KJfrc stands for the Cretaceous (K) and Jurassic (J) Franciscan Complex (f), Redwood Creek schist (rc), which underlies a portion of the Redwood Creek watershed (see “GRI Products”).
APA, Harvard, Vancouver, ISO, and other styles
9

Croft, W. Bruce. Browsing, Discovery, and Search in Large Distributed Databases of Complex and Scanned Documents. Fort Belvoir, VA: Defense Technical Information Center, January 2000. http://dx.doi.org/10.21236/ada372353.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Welton, K. C., K. Nishiizumi, and M. W. Caffee. The Search for Meterorites with Complex Exposure Histories Amoung Ordinary Chondrites with Low 3HE/21NE Ratios. Office of Scientific and Technical Information (OSTI), April 2001. http://dx.doi.org/10.2172/15013414.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Complete search' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography