Gotowa bibliografia na temat „Collision search”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Collision search”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Collision search"
Rakholiya, Kalpesh R., i Dr Dhaval Kathiriya. "Efficient Black-Box Collision Search in cryptanalysis". Paripex - Indian Journal Of Research 2, nr 1 (15.01.2012): 30–31. http://dx.doi.org/10.15373/22501991/jan2013/11.
Pełny tekst źródłaKim, Dong-Gyun, Katsutoshi Hirayama i Gyei-Kark Park. "Collision Avoidance in Multiple-Ship Situations by Distributed Local Search". Journal of Advanced Computational Intelligence and Intelligent Informatics 18, nr 5 (20.09.2014): 839–48. http://dx.doi.org/10.20965/jaciii.2014.p0839.
Pełny tekst źródłaFan, Yunsheng, Xiaojie Sun, Guofeng Wang i Dongdong Mu. "Collision Avoidance Controller for Unmanned Surface Vehicle Based on Improved Cuckoo Search Algorithm". Applied Sciences 11, nr 20 (19.10.2021): 9741. http://dx.doi.org/10.3390/app11209741.
Pełny tekst źródłaChen, Jian Zhe, Gui Tang Wang, Mei Shao i Ying Ge Li. "An Improved Multi-Label Anti-Collision Algorithm of RFID". Applied Mechanics and Materials 336-338 (lipiec 2013): 1887–91. http://dx.doi.org/10.4028/www.scientific.net/amm.336-338.1887.
Pełny tekst źródłaZhang, Hang, i Jing Sha He. "An Anti-Collision Algorithm for Applications with Massive RFID Tags". Advanced Materials Research 756-759 (wrzesień 2013): 4011–15. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.4011.
Pełny tekst źródłaWatanabe, Kento, Jun’ichi Kaneko i Kenichiro Horio. "Development of Tool Collision Avoidance Method Adapted to Uncut Workpiece Shape". International Journal of Automation Technology 11, nr 2 (1.03.2017): 235–41. http://dx.doi.org/10.20965/ijat.2017.p0235.
Pełny tekst źródłaXu, Qingyang, Chuang Zhang i Ning Wang. "Multiobjective Optimization Based Vessel Collision Avoidance Strategy Optimization". Mathematical Problems in Engineering 2014 (2014): 1–9. http://dx.doi.org/10.1155/2014/914689.
Pełny tekst źródłaByun, Hayoung, i Hyesook Lim. "Comparison on Search Failure between Hash Tables and a Functional Bloom Filter". Applied Sciences 10, nr 15 (29.07.2020): 5218. http://dx.doi.org/10.3390/app10155218.
Pełny tekst źródłaLi, Jiaoyang, Zhe Chen, Daniel Harabor, Peter J. Stuckey i Sven Koenig. "MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search". Proceedings of the AAAI Conference on Artificial Intelligence 36, nr 9 (28.06.2022): 10256–65. http://dx.doi.org/10.1609/aaai.v36i9.21266.
Pełny tekst źródłaJiang, Ruoxi, Shunying Zhu, Pan Wang, QiuCheng Chen, He Zou i Shiping Kuang. "In Search of the Consequence Severity of Traffic Conflict". Journal of Advanced Transportation 2020 (13.07.2020): 1–15. http://dx.doi.org/10.1155/2020/9089817.
Pełny tekst źródłaRozprawy doktorskie na temat "Collision search"
Wolf, Travis Benjamin. "Aircraft collision avoidance using Monte Carlo Real-Time Belief Space Search". Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/54226.
Pełny tekst źródłaThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student submitted PDF version of thesis.
Includes bibliographical references (p. 93-95).
This thesis presents the Monte Carlo Real-Time Belief Space Search (MC-RTBSS) algorithm, a novel, online planning algorithm for partially observable Markov decision processes (POMDPs). MC-RTBSS combines a sample-based belief state representation with a branch and bound pruning method to search through the belief space for the optimal policy. The algorithm is applied to the problem of aircraft collision avoidance and its performance is compared to the Trac Alert and Collision Avoidance System (TCAS) in simulated encounter scenarios. The simulations are generated using an encounter model formulated as a dynamic Bayesian network that is based on radar feeds covering U.S. airspace. MC-RTBSS leverages statistical information from the airspace model to predict future intruder behavior and inform its maneuvers. Use of the POMDP formulation permits the inclusion of different sensor suites and aircraft dynamic models. The behavior of MC-RTBSS is demonstrated using encounters generated from an airspace model and comparing the results to TCAS simulation results. In the simulations, both MC-RTBSS and TCAS measure intruder range, bearing, and relative altitude with the same noise parameters. Increasing the penalty of a Near Mid-Air Collision (NMAC) in the MC-RTBSS reward function reduces the number of NMACs, although the algorithm is limited by the number of particles used for belief state projections. Increasing the number of particles and observations used during belief state projection increases performance.
(cont.) Increasing these parameter values also increases computation time, which needs to be mitigated using a more efficient implementation of MC-RTBSS to permit real-time use.
by Travis Benjamin Wolf.
S.M.
Allen, Benjamin. "Search for New Phenomena in Dijet Events Using 13 TeV Proton-Proton Collision Data Collected With the ATLAS Detector". Thesis, University of Oregon, 2018. http://hdl.handle.net/1794/23801.
Pełny tekst źródłaFollega, Francesco Maria. "Search for boosted Higgs bosons decaying to b-quarks at sqrt{s}=13 TeV with the ATLAS detector". Doctoral thesis, Università degli studi di Trento, 2020. http://hdl.handle.net/11572/259651.
Pełny tekst źródłaFollega, Francesco Maria. "Search for boosted Higgs bosons decaying to b-quarks at sqrt{s}=13 TeV with the ATLAS detector". Doctoral thesis, Università degli studi di Trento, 2020. http://hdl.handle.net/11572/259651.
Pełny tekst źródłaGilmore, Jason R. "Search for contact interactions in deep inelastic scattering". Connect to this title online, 2002. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu983824358.
Pełny tekst źródłaTitle from first page of PDF file. Document formatted into pages; contains xx, 143 p.; also contains graphics. Includes abstract and vita. Advisor: L. Stanley Durkin, Dept. of Physics. Includes bibliographical references (p. 137-143).
Olschewski, Mark [Verfasser], Thomas [Akademischer Betreuer] Hebbeker i Christopher Henrik V. [Akademischer Betreuer] Wiebusch. "Search for new physics in proton-proton collision events with a lepton and missing transverse energy / Mark Olschewski ; Thomas Hebbeker, Christopher Wiebusch". Aachen : Universitätsbibliothek der RWTH Aachen, 2016. http://nbn-resolving.de/urn:nbn:de:hbz:82-rwth-2016-027043.
Pełny tekst źródłaOlschewski, Mark Verfasser], Thomas [Akademischer Betreuer] [Hebbeker i Christopher Henrik V. [Akademischer Betreuer] Wiebusch. "Search for new physics in proton-proton collision events with a lepton and missing transverse energy / Mark Olschewski ; Thomas Hebbeker, Christopher Wiebusch". Aachen : Universitätsbibliothek der RWTH Aachen, 2016. http://d-nb.info/1130590046/34.
Pełny tekst źródłaTashiro, Takuya. "Search for single production of Vector Like Quarks using the LHC pp collision data at √s=13 TeV collected with the ATLAS detector". Kyoto University, 2019. http://hdl.handle.net/2433/242601.
Pełny tekst źródłaTrimoska, Monika. "Combinatorics in algebraic and logical cryptanalysis". Electronic Thesis or Diss., Amiens, 2021. http://www.theses.fr/2021AMIE0005.
Pełny tekst źródłaIn this thesis, we explore the use of combinatorial techniques, such as graph-based algorithms and constraint satisfaction, in cryptanalysis. Our main focus is on the elliptic curve discrete logarithm problem. First, we tackle this problem in the case of elliptic curves defined over prime-degree binary extension fields, using the index calculus attack. A crucial step of this attack is solving the point decomposition problem, which consists in finding zeros of Semaev’s summation polynomials and can be reduced to the problem of solving a multivariate Boolean polynomial system. To this end, we encode the point decomposition problem as a logical formula and define it as an instance of the SAT problem. Then, we propose an original XOR-reasoning SAT solver, named WDSat, dedicated to this specific problem. As Semaev’s polynomials are symmetric, we extend the WDSat solver by adding a novel symmetry breaking technique that, in contrast to other symmetry breaking techniques, is not applied to the modelization or the choice of a factor base, but to the solving process. Experimental running times show that our SAT-based solving approach is significantly faster than current algebraic methods based on Gröbner basis computation. In addition, our solver outperforms other state-of-the-art SAT solvers, for this specific problem. Finally, we study the elliptic curve discrete logarithm problem in the general case. More specifically, we propose a new data structure for the Parallel Collision Search attack proposed by van Oorschot and Wiener, which has significant consequences on the memory and time complexity of this algorithm
Brintaki, Athina N. "A Computational Kinematics and Evolutionary Approach to Model Molecular Flexibility for Bionanotechnology". Scholar Commons, 2009. https://scholarcommons.usf.edu/etd/1579.
Pełny tekst źródłaKsiążki na temat "Collision search"
Leslie, Lynn D. Alaska Over-The-Horizon Backscatter Radar System: Climate factors analysis : a search for a gauge of bird collision potential. Anchorage, Alaska: University of Alaska, Arctic Environmental Information and Data Center, 1988.
Znajdź pełny tekst źródłaGustavino, Giuliano. Search for New Physics in Mono-jet Final States in pp Collisions. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-58871-1.
Pełny tekst źródłaHazumi, Masashi. Search for scalar and vector leptoquarks in electron-proton collisions at /S=300 GeV. Tokyo, Japan: University of Tokyo, 1993.
Znajdź pełny tekst źródłaSveinsson, Óttar. Útkall í Atlantshafi a jólanótt. Reykjavík: Íslenska bókaútgáfan, 1999.
Znajdź pełny tekst źródłaINFN, Eloisatron Project Workshop on Higgs Particle(s) (8th 1989 Erice Italy). Higgs particle(s): Physics issues and experimental searches in high-energy collisions. New York: Plenum Press, 1990.
Znajdź pełny tekst źródłaAli, Ahmed. Higgs Particle(s): Physics Issues and Experimental Searches in High-Energy Collisions. Boston, MA: Springer US, 1990.
Znajdź pełny tekst źródłaINFN Eloisatron Project Workshop on Higgs Particle(s): Physics Issues and Searches in High-Energy Collisions (1989 Erice, Italy). Higgs particle(s): Physics issues and experimental searches in high-energy collisions. New York: Plenum Press, 1990.
Znajdź pełny tekst źródłaWeng, Joanna. Parameterisation of electromagnetic showers and search for large extra dimensions in pp collisions at s=14 TeV. Karlsruhe: Univ.-Verl. Karlsruhe, 2006.
Znajdź pełny tekst źródłaZinser, Markus. Search for New Heavy Charged Bosons and Measurement of High-Mass Drell-Yan Production in Proton—Proton Collisions. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00650-1.
Pełny tekst źródłaIiyama, Yutaro. Search for Supersymmetry in pp Collisions at √s = 8 TeV with a Photon, Lepton, and Missing Transverse Energy. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-58661-8.
Pełny tekst źródłaCzęści książek na temat "Collision search"
Naito, Yusuke, Yu Sasaki, Takeshi Shimoyama, Jun Yajima, Noboru Kunihiro i Kazuo Ohta. "Improved Collision Search for SHA-0". W Advances in Cryptology – ASIACRYPT 2006, 21–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11935230_2.
Pełny tekst źródłaWang, Xiaoyun, Hongbo Yu i Yiqun Lisa Yin. "Efficient Collision Search Attacks on SHA-0". W Advances in Cryptology – CRYPTO 2005, 1–16. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11535218_1.
Pełny tekst źródłaMaruyama, Kazuki, i Toshimichi Saito. "A Collision PSO for Search of Periodic Points". W Nonlinear Dynamics of Electronic Systems, 59–67. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08672-9_9.
Pełny tekst źródłaCho, Hong-Su, Sangwoo Park, Soo Hak Sung i Aaram Yun. "Collision Search Attack for 53-Step HAS-160". W Information Security and Cryptology – ICISC 2006, 286–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11927587_24.
Pełny tekst źródłaDe Cannière, Christophe, Florian Mendel i Christian Rechberger. "Collisions for 70-Step SHA-1: On the Full Cost of Collision Search". W Selected Areas in Cryptography, 56–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-77360-3_4.
Pełny tekst źródłaPark, Jung Kyu, i Jaeho Kim. "Collision Avoidance Method for UAV Using A* Search Algorithm". W Advances in Intelligent, Interactive Systems and Applications, 186–93. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-02804-6_25.
Pełny tekst źródłaDevadas, Srinivas, Ling Ren i Hanshen Xiao. "On Iterative Collision Search for LPN and Subset Sum". W Theory of Cryptography, 729–46. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-70503-3_24.
Pełny tekst źródłaKhovratovich, Dmitry, Alex Biryukov i Ivica Nikolic. "Speeding up Collision Search for Byte-Oriented Hash Functions". W Topics in Cryptology – CT-RSA 2009, 164–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00862-7_11.
Pełny tekst źródłaEichlseder, Maria, Florian Mendel i Martin Schläffer. "Branching Heuristics in Differential Collision Search with Applications to SHA-512". W Fast Software Encryption, 473–88. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-46706-0_24.
Pełny tekst źródłaChailloux, André, María Naya-Plasencia i André Schrottenloher. "An Efficient Quantum Collision Search Algorithm and Implications on Symmetric Cryptography". W Advances in Cryptology – ASIACRYPT 2017, 211–40. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-70697-9_8.
Pełny tekst źródłaStreszczenia konferencji na temat "Collision search"
Battaglieri, M. "Search for Pentaquarks with CLAS". W XXV PHYSICS IN COLLISION: Proceedings of the XXV International Conference on Physics in Collision. AIP, 2006. http://dx.doi.org/10.1063/1.2173592.
Pełny tekst źródłaLin, Jian-Hung, i Keh-Chin Chang. "A Cost-Effective Search of Collision Pairs in Lagrangian Particle Tracking Method". W ASME/JSME/KSME 2015 Joint Fluids Engineering Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/ajkfluids2015-32577.
Pełny tekst źródłaUllrich, Thomas. "Where are we in the search for the Quark Gluon Plasma?" W XXV PHYSICS IN COLLISION: Proceedings of the XXV International Conference on Physics in Collision. AIP, 2006. http://dx.doi.org/10.1063/1.2173594.
Pełny tekst źródłaBai, Youjing, Lvqing Yang, Guoxing Zhang i Yezi Xu. "An improved binary search RFID anti-collision algorithm". W 2017 12th International Conference on Computer Science and Education (ICCSE). IEEE, 2017. http://dx.doi.org/10.1109/iccse.2017.8085531.
Pełny tekst źródłaYang, Lvqing, Beizhan Wang, Dingzhao Li, Jintao Tang, Yishu Qiu i Jinsheng Lu. "Four slot dynamic binary search anti-collision Algorithm". W 2019 IEEE International Conference on Computation, Communication and Engineering (ICCCE). IEEE, 2019. http://dx.doi.org/10.1109/iccce48422.2019.9010795.
Pełny tekst źródłaLi, Chao, Wenhua Zeng, Weiwei Lin, Lvqing Yang i Meihong Wang. "An improved multi-ary search based anti-collision algorithm". W 2013 International Conference on Future Computer and Information Technology. Southampton, UK: WIT Press, 2013. http://dx.doi.org/10.2495/icfcit130751.
Pełny tekst źródłaGan, Seng Keat, Robert Fitch i Salah Sukkarieh. "Real-time decentralized search with inter-agent collision avoidance". W 2012 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2012. http://dx.doi.org/10.1109/icra.2012.6224975.
Pełny tekst źródłaWang, Xinyan, i Lijun Mao. "A RFID Anti-collision Algorithm based on Q-ary Search". W 2018 Joint International Advanced Engineering and Technology Research Conference (JIAET 2018). Paris, France: Atlantis Press, 2018. http://dx.doi.org/10.2991/jiaet-18.2018.70.
Pełny tekst źródłaWeber, Brian, i Xiaowen Zhang. "Parallel hash collision search by Rho method with distinguished points". W 2018 IEEE Long Island Systems, Applications and Technology Conference (LISAT). IEEE, 2018. http://dx.doi.org/10.1109/lisat.2018.8378028.
Pełny tekst źródłaMvoulabolo, Meryle, Tebello N. D. Mathaba i Marcel O. Odhiambo. "Performance analysis of binary search based RFID anti-collision algorithms". W 2019 International Multidisciplinary Information Technology and Engineering Conference (IMITEC). IEEE, 2019. http://dx.doi.org/10.1109/imitec45504.2019.9015841.
Pełny tekst źródłaRaporty organizacyjne na temat "Collision search"
Jang, Dongwook. Search for MSSM Higgs decaying to tau pairs in ppbar collision at √s = 1.96 TeV at CDF. Office of Scientific and Technical Information (OSTI), maj 2006. http://dx.doi.org/10.2172/892378.
Pełny tekst źródłaBaranzini, Richard D. Military Support to Law Enforcement and Posse Comitatus: Is the Search for Nontraditional Missions on a Collision Course with Operational Readiness. Fort Belvoir, VA: Defense Technical Information Center, czerwiec 1993. http://dx.doi.org/10.21236/ada266650.
Pełny tekst źródłaSekula, Stephen. Search for charged Higgs bosons in the ?+jets final state with pp collision data recorded at s?=8 TeV with the ATLAS experiment. Office of Scientific and Technical Information (OSTI), sierpień 2013. http://dx.doi.org/10.2172/1120936.
Pełny tekst źródłaWang, Zhixing. Search for resonance in inclusive and b-tagged dijet mass spectra in proton-proton collision at $\sqrt{s}$ = 13 TeV and constraints on dark matter and other models. Office of Scientific and Technical Information (OSTI), grudzień 2020. http://dx.doi.org/10.2172/1764049.
Pełny tekst źródłaMeder-Marouelli, David. Search for a Light Higgs boson in the channel WH→ eνe b$\bar{b}$ in p$\bar{p}$-collision with $\sqrt{s}$ = 1.96 TeV in the D0 detector of the Tevatron. Office of Scientific and Technical Information (OSTI), lipiec 2005. http://dx.doi.org/10.2172/948153.
Pełny tekst źródłaTan, Peng, i Nicholas Sitar. Parallel Level-Set DEM (LS-DEM) Development and Application to the Study of Deformation and Flow of Granular Media. Pacific Earthquake Engineering Research Center, University of California, Berkeley, CA, marzec 2023. http://dx.doi.org/10.55461/kmiz5819.
Pełny tekst źródłaFuqiang Wang. SYSTEMATIC STUDIES OF HEAVY ION COLLISIONS TO SEARCH FOR QUARK-GLUON PLASMA. Office of Scientific and Technical Information (OSTI), listopad 2007. http://dx.doi.org/10.2172/920226.
Pełny tekst źródłaAkimoto, Takashi. Search for third generation vector leptoquarks in 1.96 TeV proton-antiproton collisions. Office of Scientific and Technical Information (OSTI), luty 2007. http://dx.doi.org/10.2172/923526.
Pełny tekst źródłaMartin, Andrew James. A Search for Top Quarks in $\bar{P}P$ Collisions Using Dileptons. Office of Scientific and Technical Information (OSTI), kwiecień 1996. http://dx.doi.org/10.2172/1421746.
Pełny tekst źródłaVaca-Alvarez, Francisco Javier. A Search for $\Lambda_b$ in $\pi^-$ a Collisions at 515-GeV/c. Office of Scientific and Technical Information (OSTI), listopad 1995. http://dx.doi.org/10.2172/1423681.
Pełny tekst źródła