Search ResultsElektronik Kaynaklar
Arama Sonuçlarını Sınırlandır
Yazar
SpringerLink (Online service)
(44)
ProQuest (Firm)
(30)
Massachusetts Institute of Technology. degree granting institution.
(6)
Adamatzky, Andrew. editor.
(3)
Gabbay, Dov M., 1945-
(3)
Materyal Türü
Dil
Yayın Yılı
-
Konu
Electronic books.
(70)
Engineering.
(43)
Computational complexity.
(42)
Complexity.
(38)
Complexity, Computational.
(37)
Kütüphane
Lokasyon
Liste görünümüne geç
Küçük resim görünümüne geç
Eylem Seç
163 sonuç bulundu Arama sonuçlarına abone ol
0000000DEFAULTTR
Yazdır
Liste seç
Bunu varsayılan liste yap.
Öğeler başarıyla eklendi
    Öğeler eklenirken hata oldu. Lütfen tekrar deneyiniz.
      Beyond Conventional Peptide Identification: Cross-Linked Peptides Identification and Unlimited Post-Translational Modification Identification için kapak resmi
      157. 
      Radio Analytics for Indoor Localization and Vital Sign Monitoring için kapak resmi
      158. 
      Radio Analytics for Indoor Localization and Vital Sign Monitoring
      by 
      Chen, Chen, author.
      http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:10685622
      Format: 
      Alıntı: 
      much reduced computational complexity. Moreover, we supplement the proposed vital sign monitoring
      Protein homoloji tespitinde bir üst sınıflandırma yaklaşımı için kapak resmi
      159. 
      Protein homoloji tespitinde bir üst sınıflandırma yaklaşımı
      by 
      Polatkan, Aydın Can
      Tam metin Pdf (3.2 mb) http://lib.baskent.edu.tr/tezbaskent/00157.pdf
      Format: 
      Alıntı: 
      availability percentage of each of the n-length substrings inside the sequence. To reduce the space complexity
      Handbook of constraint programming için kapak resmi
      160. 
      Handbook of constraint programming
      by 
      Rossi, Francesca, 1962-
      ScienceDirect http://www.sciencedirect.com/science/book/9780444527264
      ScienceDirect http://www.sciencedirect.com/science/bookseries/15746526/2
      Format: 
      Alıntı: 
      constraints, tractability and computational complexity, and important issues in modeling a problem as a
      Many-dimensional modal logics : theory and applications için kapak resmi
      161. 
      Many-dimensional modal logics : theory and applications
      by 
      Gabbay, Dov M., 1945-
      ScienceDirect http://www.sciencedirect.com/science/book/9780444508263
      ScienceDirect http://www.sciencedirect.com/science/publication?issn=0049237X&volume=148
      ScienceDirect http://www.sciencedirect.com/science/bookseries/0049237X/148
      Format: 
      Alıntı: 
      three major problems: decidability, axiomatizability, and computational complexity. Besides the standard
      Logic, methodology and philosophy of science IV : proceedings of the Fourth International congress for Logic, Methodology and Philosophy of Science, Bucharest, 1971 için kapak resmi
      162. 
      Logic, methodology and philosophy of science IV : proceedings of the Fourth International congress for Logic, Methodology and Philosophy of Science, Bucharest, 1971
      by 
      International Congress for Logic, Methodology, and Philosophy of Science (4th : 1971 : Bucharest, Romania)
      ScienceDirect http://www.sciencedirect.com/science/book/9780444104915
      ScienceDirect http://www.sciencedirect.com/science/bookseries/0049237X/74
      ScienceDirect https://www.sciencedirect.com/science/publication?issn=0049237X&volume=74
      Format: 
      Alıntı: 
      ; Chapter 16 Formalization of Some Notions in Terms of Computational Complexity
      Algorithms and Algorithmic Obstacles for Probabilistic Combinatorial Structures için kapak resmi
      163. 
      Algorithms and Algorithmic Obstacles for Probabilistic Combinatorial Structures
      by 
      Li, Quan, author.
      http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:10902456
      Format: 
      Alıntı: 
      complexity and computational cost for reconstructing (approximately) an unknown low-rank matrix. The novelty
      Eylem Seç