Auswahl der wissenschaftlichen Literatur zum Thema „Linear search“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Linear search" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Linear search"
Hohzaki, Ryusuke. „A SEARCH GAME TAKING ACCOUNT OF LINEAR EFFECTS AND LINEAR CONSTRAINTS OF SEARCHING RESOURCE“. Journal of the Operations Research Society of Japan 55, Nr. 1 (2012): 1–22. http://dx.doi.org/10.15807/jorsj.55.1.
Der volle Inhalt der QuelleMäkinen, Erkki. „On linear search heuristics“. Information Processing Letters 29, Nr. 1 (September 1988): 35–36. http://dx.doi.org/10.1016/0020-0190(88)90129-9.
Der volle Inhalt der QuelleHester, J. H., und D. S. Hirschberg. „Self-organizing linear search“. ACM Computing Surveys 17, Nr. 3 (September 1985): 295–311. http://dx.doi.org/10.1145/5505.5507.
Der volle Inhalt der QuelleArora, Nitin, Garima Bhasin und Neha Sharma. „Two way Linear Search Algorithm“. International Journal of Computer Applications 107, Nr. 21 (18.12.2014): 6–8. http://dx.doi.org/10.5120/19137-9622.
Der volle Inhalt der QuelleLimoncelli, Thomas A. „10 optimizations on linear search“. Communications of the ACM 59, Nr. 9 (24.08.2016): 44–48. http://dx.doi.org/10.1145/2980976.
Der volle Inhalt der QuelleLimoncelli, Thomas A. „10 Optimizations on Linear Search“. Queue 14, Nr. 4 (August 2016): 20–33. http://dx.doi.org/10.1145/2984629.2984631.
Der volle Inhalt der QuelleKorf, Richard E. „Linear-space best-first search“. Artificial Intelligence 62, Nr. 1 (Juli 1993): 41–78. http://dx.doi.org/10.1016/0004-3702(93)90045-d.
Der volle Inhalt der QuelleFoley, R. D., T. P. Hill und M. C. Spruill. „Linear search with bounded resources“. Naval Research Logistics 38, Nr. 4 (August 1991): 555–65. http://dx.doi.org/10.1002/1520-6750(199108)38:4<555::aid-nav3220380408>3.0.co;2-8.
Der volle Inhalt der QuelleKumari, Anchala. „Linear Search Versus Binary Search:A Statistical Comparison For Binomial Inputs“. International Journal of Computer Science, Engineering and Applications 2, Nr. 2 (30.04.2012): 29–39. http://dx.doi.org/10.5121/ijcsea.2012.2203.
Der volle Inhalt der QuelleBalkhi, Zaid T. „THE GENERALIZED LINEAR SEARCH PROBLEM, EXISTENCE OF OPTIMAL SEARCH PATHS“. Journal of the Operations Research Society of Japan 30, Nr. 4 (1987): 399–421. http://dx.doi.org/10.15807/jorsj.30.399.
Der volle Inhalt der QuelleDissertationen zum Thema "Linear search"
Rees, Leigh H. „Chirality : in search of organometallic second order non-linear optic materials“. Thesis, University of Bristol, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.265324.
Der volle Inhalt der QuelleHepburn, Ian David. „Development of linear InSb array instrumentation and the search for brown dwarfs“. Thesis, Imperial College London, 1991. http://hdl.handle.net/10044/1/46816.
Der volle Inhalt der QuelleBothwell, Brian P. „An Iterative Linear Programming Approach to Solving Large Cumulative Search-Evasion Games“. Thesis, Monterey, California. Naval Postgraduate School, 1990. http://hdl.handle.net/10945/30678.
Der volle Inhalt der QuelleCumulative search-evasion games (CSEGs) involve two players, a searcher and an evader, who move among some finite set of cells. Neither player is aware of the other player's position during any stage of the game. When the payoff for the game is assumed to be the number of times the searcher and evader occupy the same cell, Eagle and Washburn proposed two solution techniques: one by fictitious play and the other by solving equivalent linear programming formulations. However, both have proved to be time consuming even for moderately sized problems. This thesis considers two alternate linear programming formulations for CSEGs. Since both contain a large number of variables and constraints, the linear programming problems are initially solved with many of the constraints removed. If the solution to this relaxed problem is not a feasible optimal solution, additional constraints are added and the problem is solved again. This process continues until a feasible optimal solution is found. The results from a numerical experimentation with various solution techniques are also presented.
Madabushi, Ananth R. „Lagrangian Relaxation / Dual Approaches For Solving Large-Scale Linear Programming Problems“. Thesis, Virginia Tech, 1997. http://hdl.handle.net/10919/36833.
Der volle Inhalt der QuelleMaster of Science
Kim, Seongsu. „A BAYESIAN EVIDENCE DEFINING SEARCH“. The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1429789001.
Der volle Inhalt der QuelleLaw, Glenn W. (Glenn Woodrow). „Measurements of ocular counterrolling during linear accelerations using an electromagnetic scleral search coil system“. Thesis, Massachusetts Institute of Technology, 1991. http://hdl.handle.net/1721.1/43236.
Der volle Inhalt der QuelleStokes, Klara. „Combinatorial structures for anonymous database search“. Doctoral thesis, Universitat Rovira i Virgili, 2011. http://hdl.handle.net/10803/52799.
Der volle Inhalt der QuelleVasireddy, Jhansi Lakshmi. „Applications of Linear Algebra to Information Retrieval“. Digital Archive @ GSU, 2009. http://digitalarchive.gsu.edu/math_theses/71.
Der volle Inhalt der QuelleLopez, Soto Claudia Orquidea. „Formulation space search for two-dimensional packing problems“. Thesis, Brunel University, 2013. http://bura.brunel.ac.uk/handle/2438/7455.
Der volle Inhalt der QuelleLazic, Jasmina. „New variants of variable neighbourhood search for 0-1 mixed integer programming and clustering“. Thesis, Brunel University, 2010. http://bura.brunel.ac.uk/handle/2438/4602.
Der volle Inhalt der QuelleBücher zum Thema "Linear search"
Laguna, Manuel. Scatter search: Methodology and implementation in C. Boston, MA: Kluwer Academic Publishers, 2003.
Den vollen Inhalt der Quelle findenRafael, Martí, Hrsg. Scatter search: Methodology and implementations in C. Boston: Kluwer Academic Publishers, 2003.
Den vollen Inhalt der Quelle findenH, Hoos Holger, Birattari Mauro und SpringerLink (Online service), Hrsg. Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics: Second International Workshop, SLS 2009, Brussels, Belgium, September 3-4, 2009. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009.
Den vollen Inhalt der Quelle findenDalle navi bianche alla Linea gotica, 1941-1944. Milano: Mursia, 2011.
Den vollen Inhalt der Quelle findenNakov, Svetlin. Fundamentals of Computer Programming with C#: The Bulgarian C# Book. Sofia, Bulgaria: Svetlin Nakov, 2013.
Den vollen Inhalt der Quelle findenSerafimova, Vera, Ivan Pankeev und L. G. Tyurina. History of Russian literature of the XX-XXI centuries. ru: INFRA-M Academic Publishing LLC., 2022. http://dx.doi.org/10.12737/1866868.
Der volle Inhalt der QuelleSerafimova, Vera. History of Russian literature of XX-XXI centuries. ru: INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/1138897.
Der volle Inhalt der QuelleAron, Richard M., Luis Bernal-Gonzalez, Daniel M. Pellegrino und Juan B. Seoane Sepulveda. Lineability: The Search for Linearity in Mathematics. Taylor & Francis Group, 2015.
Den vollen Inhalt der Quelle findenAron, Richard M., Luis Bernal-Gonzalez, Daniel M. Pellegrino und Juan B. Seoane Sepulveda. Lineability: The Search for Linearity in Mathematics. Taylor & Francis Group, 2015.
Den vollen Inhalt der Quelle findenAron, Richard M., Luis Bernal-Gonzalez, Daniel M. Pellegrino und Juan B. Seoane Sepulveda. Lineability: The Search for Linearity in Mathematics. Taylor & Francis Group, 2015.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Linear search"
Weik, Martin H. „linear search“. In Computer Science and Communications Dictionary, 898. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_10241.
Der volle Inhalt der QuelleFeijen, W. H. J., und A. J. M. van Gasteren. „The Parallel Linear Search“. In Monographs in Computer Science, 201–6. New York, NY: Springer New York, 1999. http://dx.doi.org/10.1007/978-1-4757-3126-2_18.
Der volle Inhalt der QuelleSubero, Armstrong. „Linear and Binary Search“. In Codeless Data Structures and Algorithms, 63–69. Berkeley, CA: Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-5725-8_6.
Der volle Inhalt der QuelleThordsen, Erik, und Erich Schubert. „On Projections to Linear Subspaces“. In Similarity Search and Applications, 75–88. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-17849-8_7.
Der volle Inhalt der QuelleSpirtes, Peter, Clark Glymour und Richard Scheines. „Elaborating Linear Theories with Unmeasured Variables“. In Causation, Prediction, and Search, 323–53. New York, NY: Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4612-2748-9_11.
Der volle Inhalt der QuelleCollet, Jean-François. „Linear algebra and search engines“. In Discrete Stochastic Processes and Applications, 33–55. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-74018-8_2.
Der volle Inhalt der QuelleZhang, Shiwei, Guomin Yang und Yi Mu. „Linear Encryption with Keyword Search“. In Information Security and Privacy, 187–203. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-40367-0_12.
Der volle Inhalt der QuelleBoytsov, Leonid. „Super-Linear Indices for Approximate Dictionary Searching“. In Similarity Search and Applications, 162–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32153-5_12.
Der volle Inhalt der QuelleHünemörder, Maximilian Archimedes Xaver, Daniyal Kazempour, Peer Kröger und Thomas Seidl. „SIDEKICK: Linear Correlation Clustering with Supervised Background Knowledge“. In Similarity Search and Applications, 221–30. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32047-8_20.
Der volle Inhalt der QuelleMunro, J. Ian. „On the Competitiveness of Linear Search“. In Algorithms - ESA 2000, 338–45. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-45253-2_31.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Linear search"
Hossain, Md Emran, Syed Bayazid Hossain, Md Sha Alam Tutul und Shamsun Nahar. „Optimized Search Functionality with Linear Search Algorithm“. In International Conference on Emerging Trends in Engineering and Advanced Science. AIJR Publisher, 2022. http://dx.doi.org/10.21467/proceedings.123.6.
Der volle Inhalt der QuelleFrancis, Alwin, und Rajesh Ramachandran. „Modulo Ten Search- An Alternative to Linear Search“. In 2011 International Conference on Process Automation, Control and Computing (PACC). IEEE, 2011. http://dx.doi.org/10.1109/pacc.2011.5979034.
Der volle Inhalt der QuelleSpampinato, Daniele G., Upasana Sridhar und Tze Meng Low. „Linear algebraic depth-first search“. In the 6th ACM SIGPLAN International Workshop. New York, New York, USA: ACM Press, 2019. http://dx.doi.org/10.1145/3315454.3329962.
Der volle Inhalt der QuelleJacob, Asha Elza, Nikhil Ashodariya und Aakash Dhongade. „Hybrid search algorithm: Combined linear and binary search algorithm“. In 2017 International Conference on Energy, Communication, Data Analytics and Soft Computing (ICECDS). IEEE, 2017. http://dx.doi.org/10.1109/icecds.2017.8389704.
Der volle Inhalt der QuelleKong, Taeyong, Taeri Kim, Jinsung Jeon, Jeongwhan Choi, Yeon-Chang Lee, Noseong Park und Sang-Wook Kim. „Linear, or Non-Linear, That is the Question!“ In WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3488560.3498501.
Der volle Inhalt der QuelleJones, Colin N., und Jan M. Maciejowski. „Reverse Search for Parametric Linear Programming“. In Proceedings of the 45th IEEE Conference on Decision and Control. IEEE, 2006. http://dx.doi.org/10.1109/cdc.2006.377799.
Der volle Inhalt der QuelleHeide, Friedhelm Meyer auf der. „Nondeterministic versus probabilistic linear search algorithms“. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985). IEEE, 1985. http://dx.doi.org/10.1109/sfcs.1985.38.
Der volle Inhalt der QuelleHeydari, Javad, und Ali Tajer. „Quickest linear search over correlated sequences“. In 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, 2015. http://dx.doi.org/10.1109/isit.2015.7282558.
Der volle Inhalt der QuelleTekli, Joe, Gilbert Tekli und Richard Chbeir. „Almost Linear Semantic XML Keyword Search“. In MEDES '21: International Conference on Management of Digital EcoSystems. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3444757.3485079.
Der volle Inhalt der QuelleVenkatesan, Sibi, James K. Miller, Jeff Schneider und Artur Dubrawski. „Scaling Active Search using Linear Similarity Functions“. In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/401.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Linear search"
Ghosh, Subir. Influential Nonegligible Parameters under the Search Linear Model. Fort Belvoir, VA: Defense Technical Information Center, April 1986. http://dx.doi.org/10.21236/ada170079.
Der volle Inhalt der QuelleGhosh, Subir. Influential Nonnegligible Parameters Under the Search Linear Model. Fort Belvoir, VA: Defense Technical Information Center, April 1986. http://dx.doi.org/10.21236/ada172007.
Der volle Inhalt der QuelleHough, P. D. Stable computation of search directions for near-degenerate linear programming problems. Office of Scientific and Technical Information (OSTI), März 1997. http://dx.doi.org/10.2172/477537.
Der volle Inhalt der QuelleLewis, Robert Michael, Virginia Joanne Torczon und Tamara Gibson Kolda. A generating set direct search augmented Lagrangian algorithm for optimization with a combination of general and linear constraints. Office of Scientific and Technical Information (OSTI), August 2006. http://dx.doi.org/10.2172/893121.
Der volle Inhalt der QuelleChen, Z., S. E. Grasby, C. Deblonde und X. Liu. AI-enabled remote sensing data interpretation for geothermal resource evaluation as applied to the Mount Meager geothermal prospective area. Natural Resources Canada/CMSS/Information Management, 2022. http://dx.doi.org/10.4095/330008.
Der volle Inhalt der QuelleKoch, J. A. Imaging crystal/spectral line search. Office of Scientific and Technical Information (OSTI), Februar 1998. http://dx.doi.org/10.2172/670066.
Der volle Inhalt der QuelleLewis, Robert Michael, ), Joshua D. Griffin und Tamara Gibson Kolda. Asynchronous parallel generating set search for linearly-constrained optimization. Office of Scientific and Technical Information (OSTI), August 2006. http://dx.doi.org/10.2172/891372.
Der volle Inhalt der QuelleKolda, Tamara G., Joshua Griffin und Robert Michael Lewis. Asynchronous parallel generating set search for linearly-constrained optimization. Office of Scientific and Technical Information (OSTI), April 2007. http://dx.doi.org/10.2172/1139970.
Der volle Inhalt der QuelleLewis, Robert Michael, Virginia Joanne Torczon und Tamara Gibson Kolda. Stationarity results for generating set search for linearly constrained optimization. Office of Scientific and Technical Information (OSTI), Oktober 2003. http://dx.doi.org/10.2172/918255.
Der volle Inhalt der QuelleAlonso-Robisco, Andrés, José Manuel Carbó und José Manuel Carbó. Machine Learning methods in climate finance: a systematic review. Madrid: Banco de España, Februar 2023. http://dx.doi.org/10.53479/29594.
Der volle Inhalt der Quelle