intTypePromotion=1
zunia.vn Tuyển sinh 2024 dành cho Gen-Z zunia.vn zunia.vn
ADSENSE

On the computational complexity

Xem 1-12 trên 12 kết quả On the computational complexity
  • The thesis is structured as follows: In Chapter 1, the scientific literature is summarized within the scope of this study. Chapter 2 provides a comprehensive overview of the principles of the applied computational approaches in this study. Chapter 3 identifies the important residues of the LsIA/α7 nAChR complex that affect the interactions between the toxin and the membrane protein due to C-terminal carboxylation of LsIA. The effects of C-terminal modification of LsIA on interactions with α3β2 nAChR, involved in cardiovascular diseases, were also investigated in Chapter 4.

    pdf234p runthenight04 02-02-2023 11 3   Download

  • Research objectives of the thesis: Research the theories of complex fuzzy sets, complex fuzzy logic and measures based on complex fuzzy sets; research and development of fuzzy inference system based on complex fuzzy sets; research applied techniques to reduce rules, optimize fuzzy rules in complex fuzzy inference system; research on how to represent rules based on fuzzy knowledge graphs to reduce inference computation time for the test set and deal with the cases where the new dataset is not present in the training data set.

    pdf27p beloveinhouse01 15-08-2021 17 4   Download

  • By analyzing the emerging needs as described above, this thesis specified the research target as to propose a feature having a novel yet efficient and low complex ity graph structure in detecting multi-arch IoT botnet with high accuracy.

    pdf30p capheviahe27 23-02-2021 10 3   Download

  • Parallel Implementation of MAFFT on CUDA-Enabled Graphics Hardware present a new approach to accelerat- ing MAFFT on Graphics Processing Units (GPUs) using the Compute Unified Device Architecture (CUDA) programming model. Compared with the implementations of other MSA algorithms on GPUs, parallelization of MAFFT is more challenging since the space complexity.

     

    pdf14p ducla78 30-07-2015 48 6   Download

  • The direct conversion of plant cell wall polysaccharides into soluble sugars is one of the most important reactions on earth, and is performed by cer-tain microorganisms such as Clostridium thermocellum(Ct). These organ-isms produce extracellular multi-subunit complexes (i.e. cellulosomes) comprising a consortium of enzymes, which contain noncatalytic carbohy-drate-binding modules (CBM) that increase the activity of the catalytic module.

    pdf12p media19 06-03-2013 45 4   Download

  • We prove the Minimum Vertex Cover problem to be NP-hard to approximate to within a factor of 1.3606, extending on previous PCP and hardness of approximation technique. To that end, one needs to develop a new proof framework, and to borrow and extend ideas from several fields. 1. Introduction The basic purpose of computational complexity theory is to classify computational problems according to the amount of resources required to solve them. In particular, the most basic task is to classify computational problems to those that are efficiently solvable and those that are not. ...

    pdf48p noel_noel 17-01-2013 60 6   Download

  • We consider a specialization of an untwisted quantum affine algebra of type ADE at a nonzero complex number, which may or may not be a root of unity. The Grothendieck ring of its finite dimensional representations has two bases, simple modules and standard modules. We identify entries of the transition matrix with special values of “computable” polynomials, similar to Kazhdan-Lusztig polynomials. At the same time we “compute” q-characters for all simple modules. The result is based on “computations” of Betti numbers of graded/cyclic quiver varieties.

    pdf42p tuanloccuoi 04-01-2013 52 8   Download

  • Enzymes are basically composed of 20 naturally occurring amino acids, yet they catalyse a dizzying array of chemical reactions, with regiospecificity and stereospecificity and under physiological conditions. In this review, we attempt to gain some understanding of these complex proteins

    pdf11p cosis54 09-12-2012 44 2   Download

  • EURASIP Journal on Applied Signal Processing 2003:8, 733–739 c 2003 Hindawi Publishing Corporation Editorial Riccardo Poli Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, CO4 3SQ, UK Email: rpoli@essex.ac.uk Stefano Cagnoni Department of Computer Engineering, University of Parma, 43100 Parma, Italy Email: cagnoni@ce.unipr.it 1. INTRODUCTION Darwinian evolution is probably the most intriguing and powerful mechanism of nature mankind has ever discovered.

    pdf7p sting12 10-03-2012 34 6   Download

  • EURASIP Journal on Applied Signal Processing 2003:7, 649–658 c 2003 Hindawi Publishing Corporation Analog VLSI Models of Range-Tuned Neurons in the Bat Echolocation System Matthew Cheely Neurosciences and Cognitive Sciences Program, University of Maryland, College Park, MD 20742, USA Email: mcheely@isr.umd.edu Timothy Horiuchi Department of Electrical and Computer Engineering, University of Maryland, College Park, MD 20742, USA Institute for Systems Research, University of Maryland, College Park, MD 20742, USA Email: timmer@isr.umd.

    pdf10p sting12 10-03-2012 41 5   Download

  • ONE PARAMETER FAMILY OF LINEAR DIFFERENCE EQUATIONS AND THE STABILITY PROBLEM FOR THE NUMERICAL SOLUTION OF ODEs L. ACETO, R. PANDOLFI, AND D. TRIGIANTE Received 21 July 2004; Accepted 4 October 2004 The study of the stability properties of numerical methods leads to considering linear difference equations depending on a complex parameter q. Essentially, the associated characteristic polynomial must have constant type for q ∈ C− . Usually such request is proved with the help of computers.

    pdf14p sting12 10-03-2012 46 7   Download

  • Tuyển tập các báo cáo nghiên cứu khoa học hay nhất của tạp chí toán học quốc tế đề tài: A Note on the Asymptotics and Computational Complexity of Graph Distinguishability...

    pdf7p thulanh4 11-09-2011 42 3   Download

CHỦ ĐỀ BẠN MUỐN TÌM

ADSENSE

nocache searchPhinxDoc

 

Đồng bộ tài khoản
2=>2