WALCOM: Algorithms and Computation. 1st ed. 2017

QR kȏd

WALCOM: Algorithms and Computation. 1st ed. 2017

Spremljeno u:

Bibliografski detalji
Glavni autori:	Poon, Sheung-Hung, Rahman, Md. Saidur, Yen, Hsu-Chun
Format:	Knjiga
Jezik:	English
Izdano:	Springer International Publishing 2020
Teme:	Computer Science Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Numeric Computing
Online pristup:	http://doi.org/10.1007/978-3-319-53925-6 https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/99079
Oznake:	Dodaj oznaku Bez oznaka, Budi prvi tko označuje ovaj zapis!

Thư viện lưu trữ:	Thư viện Trường Đại học Đà Lạt

Similar Items

WALCOM: Algorithms and Computation
Izdano: (2020)

WALCOM: Algorithms and Computation
od: Nakano, Shin-ichi, i dr.
Izdano: (2020)

WALCOM: Algorithms and Computation
od: Rahman, M. Sohel, i dr.
Izdano: (2020)

Frontiers in Algorithmics. 1st ed. 2017
od: Xiao, Mingyu, i dr.
Izdano: (2020)

Algorithmic Aspects of Cloud Computing
od: Alistarh, Dan, i dr.
Izdano: (2020)

Algorithms for Computational Biology. 1st ed. 2017
od: Figueiredo, Daniel, i dr.
Izdano: (2020)

Integer Programming and Combinatorial Optimization. 1st ed. 2017
od: Eisenbrand, Friedrich, i dr.
Izdano: (2020)

Combinatorial Algorithms
od: Brankovic, Ljiljana, i dr.
Izdano: (2020)

Guide to Graph Algorithms
od: Erciyes, K
Izdano: (2020)

Approximation and Online Algorithms
od: Solis-Oba, Roberto, i dr.
Izdano: (2020)

SOFSEM 2020: Theory and Practice of Computer Science
od: Chatzigeorgiou, Alexander, i dr.
Izdano: (2020)

Algorithms and Models for the Web-Graph
Izdano: (2020)

Algorithms and Complexity. 1st ed. 2017
od: Fotakis, Dimitris, i dr.
Izdano: (2020)

Approximation and Online Algorithms. 1st ed. 2017
od: Jansen, Klaus, i dr.
Izdano: (2020)

Algorithms and Data Structures. 1st ed. 2017
od: Ellen, Faith, i dr.
Izdano: (2020)

Algorithms and Discrete Applied Mathematics. 1st ed. 2017
od: Gaur, Daya, i dr.
Izdano: (2020)

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
od: Beldiceanu, Nicolas, i dr.
Izdano: (2020)

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
od: Hentenryck, Pascal Van, i dr.
Izdano: (2020)

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
od: Achterberg, Tobias, i dr.
Izdano: (2020)

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
od: Hoeve, Willem-Jan van, i dr.
Izdano: (2020)

Computing and Combinatorics
od: Wang, Lusheng, i dr.
Izdano: (2020)

Computing and Combinatorics
Izdano: (2020)

Computing and Combinatorics
od: Cao, Yixin, i dr.
Izdano: (2020)

Graph-Theoretic Concepts in Computer Science
od: Brandstädt, Andreas, i dr.
Izdano: (2020)

Theoretical Computer Science and Discrete Mathematics
od: Arumugam, S., i dr.
Izdano: (2020)

Random Numbers and Computers
od: Kneusel, Ronald T.
Izdano: (2020)

Large-Scale Scientific Computing
od: Lirkov, Ivan, i dr.
Izdano: (2020)

Evolutionary Computation in Combinatorial Optimization
od: Liefooghe, Arnaud, i dr.
Izdano: (2020)

Evolutionary Computation in Combinatorial Optimization
od: Hu, Bin, i dr.
Izdano: (2020)

Computer Science – Theory and Applications. 1st ed. 2017
od: Weil, Pascal
Izdano: (2020)

Computer Algebra and Geometric Algebra with Applications
Izdano: (2020)

Combinatorial Optimization and Applications
od: Gao, Xiaofeng, i dr.
Izdano: (2020)

Advances in Artificial Intelligence
od: Herrera, Francisco, i dr.
Izdano: (2020)

Graph Transformation
od: Lambers, Leen, i dr.
Izdano: (2020)

Graph Drawing and Network Visualization
od: Frati, Fabrizio, i dr.
Izdano: (2020)

Progress in Cryptology – INDOCRYPT 2007
od: Srinathan, K., i dr.
Izdano: (2020)

Combinatorial Optimization and Applications
od: Gao, Xiaofeng, i dr.
Izdano: (2020)

Progress in Cryptology - INDOCRYPT 2008
Izdano: (2020)

The Discrete Math Workbook
od: Kurgalin, Sergei, i dr.
Izdano: (2020)

Artificial Evolution
od: Lutton, Evelyne, i dr.
Izdano: (2020)