default search action
Search dblp for Publications
export results for "classical procedure"
@article{DBLP:journals/tc/SouzaCF22, author = {Luciano S. de Souza and Jonathan H. A. de Carvalho and Tiago A. E. Ferreira}, title = {Classical Artificial Neural Network Training Using Quantum Walks as a Search Procedure}, journal = {{IEEE} Trans. Computers}, volume = {71}, number = {2}, pages = {378--389}, year = {2022}, url = {https://doi.org/10.1109/TC.2021.3051559}, doi = {10.1109/TC.2021.3051559}, timestamp = {Tue, 08 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tc/SouzaCF22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/wpc/YadavM22, author = {Rajesh Kumar Yadav and Rashmi Mishra}, title = {Cluster-Based Classical Routing Protocols and Authentication Algorithms in {WSN:} {A} Survey Based on Procedures and Methods}, journal = {Wirel. Pers. Commun.}, volume = {123}, number = {3}, pages = {2777--2833}, year = {2022}, url = {https://doi.org/10.1007/s11277-021-09265-7}, doi = {10.1007/S11277-021-09265-7}, timestamp = {Sat, 27 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/wpc/YadavM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/dnb/Altschaffel20, author = {Robert Altschaffel}, title = {Computer forensics in cyber-physical systems: applying existing forensic knowledge and procedures from classical {IT} to automation and automotive}, school = {Otto-von-Guericke University Magdeburg, Germany}, year = {2020}, url = {https://nbn-resolving.org/urn:nbn:de:gbv:ma9:1-1981185920-355742}, urn = {urn:nbn:de:gbv:ma9:1-1981185920-355742}, timestamp = {Sat, 17 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/dnb/Altschaffel20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsc/Ye17, author = {Liangjie Ye}, title = {A symbolic decision procedure for relations arising among Taylor coefficients of classical Jacobi theta functions}, journal = {J. Symb. Comput.}, volume = {82}, pages = {134--163}, year = {2017}, url = {https://doi.org/10.1016/j.jsc.2017.01.005}, doi = {10.1016/J.JSC.2017.01.005}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jsc/Ye17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/access/BabarBANH15, author = {Zunaira Babar and Panagiotis Botsinis and Dimitrios Alanis and Soon Xin Ng and Lajos Hanzo}, title = {The Road From Classical to Quantum Codes: {A} Hashing Bound Approaching Design Procedure}, journal = {{IEEE} Access}, volume = {3}, pages = {146--176}, year = {2015}, url = {https://doi.org/10.1109/ACCESS.2015.2405533}, doi = {10.1109/ACCESS.2015.2405533}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/access/BabarBANH15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/socs/CelorrioJ15, author = {Sergio Jim{\'{e}}nez Celorrio and Anders Jonsson}, editor = {Levi Lelis and Roni Stern}, title = {Computing Plans with Control Flow and Procedures Using a Classical Planner}, booktitle = {Proceedings of the Eighth Annual Symposium on Combinatorial Search, {SOCS} 2015, 11-13 June 2015, Ein Gedi, the Dead Sea, Israel}, pages = {62--69}, publisher = {{AAAI} Press}, year = {2015}, url = {https://doi.org/10.1609/socs.v6i1.18360}, doi = {10.1609/SOCS.V6I1.18360}, timestamp = {Wed, 24 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/socs/CelorrioJ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BabarBANH15, author = {Zunaira Babar and Panagiotis Botsinis and Dimitrios Alanis and Soon Xin Ng and Lajos Hanzo}, title = {The Road From Classical to Quantum Codes: {A} Hashing Bound Approaching Design Procedure}, journal = {CoRR}, volume = {abs/1503.02372}, year = {2015}, url = {http://arxiv.org/abs/1503.02372}, eprinttype = {arXiv}, eprint = {1503.02372}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BabarBANH15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ieicet/Oshima10, author = {Kazuto Oshima}, title = {A Simple Procedure for Classical Signal-Processing in Cluster-State Quantum Computation}, journal = {{IEICE} Trans. Inf. Syst.}, volume = {93-D}, number = {5}, pages = {1291--1293}, year = {2010}, url = {https://doi.org/10.1587/transinf.E93.D.1291}, doi = {10.1587/TRANSINF.E93.D.1291}, timestamp = {Sat, 11 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ieicet/Oshima10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bams/KononowiczR09, author = {Andrzej A. Kononowicz and Irena Roterman}, title = {Chemical pathways - visualisation of classical analytical procedures in chemistry by the use of flow charts}, journal = {Bio Algorithms Med Syst.}, volume = {5}, number = {9}, pages = {121--126}, year = {2009}, timestamp = {Thu, 20 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/bams/KononowiczR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mmas/Calderon07, author = {Christopher P. Calderon}, title = {Fitting Effective Diffusion Models to Data Associated with a "Glassy" Potential: Estimation, Classical Inference Procedures, and Some Heuristics}, journal = {Multiscale Model. Simul.}, volume = {6}, number = {2}, pages = {656--687}, year = {2007}, url = {https://doi.org/10.1137/050643647}, doi = {10.1137/050643647}, timestamp = {Tue, 31 Mar 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mmas/Calderon07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcc/Zhou06, author = {Shiqi Zhou}, title = {Rapidly convergent procedure to solve the density profile equation in the classical density functional theory}, journal = {J. Comput. Chem.}, volume = {27}, number = {8}, pages = {941--947}, year = {2006}, url = {https://doi.org/10.1002/jcc.20401}, doi = {10.1002/JCC.20401}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcc/Zhou06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jar/GiunchigliaTG02, author = {Enrico Giunchiglia and Armando Tacchella and Fausto Giunchiglia}, title = {SAT-Based Decision Procedures for Classical Modal Logics}, journal = {J. Autom. Reason.}, volume = {28}, number = {2}, pages = {143--171}, year = {2002}, url = {https://doi.org/10.1023/A:1015071400913}, doi = {10.1023/A:1015071400913}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jar/GiunchigliaTG02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cstat/GelmanT00, author = {Andrew Gelman and Francis Tuerlinckx}, title = {Type {S} error rates for classical and Bayesian single and multiple comparison procedures}, journal = {Comput. Stat.}, volume = {15}, number = {3}, pages = {373--390}, year = {2000}, url = {https://doi.org/10.1007/s001800000040}, doi = {10.1007/S001800000040}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cstat/GelmanT00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cmg/Carlisle98, author = {Richard A. Carlisle}, title = {Classical Comparative Analysis Procedures and Deterministic Chaos}, booktitle = {24th International Computer Measurement Group Conference, December 6-11, 1998, Anaheim, California, USA, Proceedings}, pages = {260--271}, publisher = {Computer Measurement Group}, year = {1998}, url = {http://www.cmg.org/?s2member\_file\_download=/proceedings/1998/8029.pdf}, timestamp = {Wed, 17 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cmg/Carlisle98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ki/OttenK96, author = {Jens Otten and Christoph Kreitz}, editor = {G{\"{u}}nther G{\"{o}}rz and Steffen H{\"{o}}lldobler}, title = {A Uniform Proof Procedure for Classical and Non-Classical Logics}, booktitle = {{KI-96:} Advances in Artificial Intelligence, 20th Annual German Conference on Artificial Intelligence, Dresden, Germany, September 17-19, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1137}, pages = {307--319}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-61708-6\_70}, doi = {10.1007/3-540-61708-6\_70}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ki/OttenK96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/File87, author = {Gilberto Fil{\'{e}}}, title = {Classical and Incremental Attribute Evaluation by Means of Recursive Procedures}, journal = {Theor. Comput. Sci.}, volume = {53}, pages = {25--65}, year = {1987}, url = {https://doi.org/10.1016/0304-3975(87)90026-0}, doi = {10.1016/0304-3975(87)90026-0}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/File87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/nh/82/Schaafsma82, author = {Willem Schaafsma}, editor = {Paruchuri R. Krishnaiah and Laveen N. Kanal}, title = {40 Selecting variables in discriminant analysis for improving upon classical procedures}, booktitle = {Classification, Pattern Recognition and Reduction of Dimensionality}, series = {Handbook of Statistics}, volume = {2}, pages = {857--881}, publisher = {North-Holland}, year = {1982}, url = {https://doi.org/10.1016/s0169-7161(82)02043-4}, doi = {10.1016/S0169-7161(82)02043-4}, timestamp = {Tue, 23 Jun 2020 14:02:52 +0200}, biburl = {https://dblp.org/rec/books/nh/82/Schaafsma82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.