Modelling computing systems : mathematics for computer science

This engaging text presents the fundamental mathematics and modelling techniques for computing systems in a novel and light-hearted way, which can be easily followed by students at the very beginning of their university education. Key concepts are taught through a large collection of challenging yet fun mathematical games and logical puzzles that require no prior knowledge about computers. The …

Glencoe dictionary of word processing

Edisi

-

ISBN/ISSN

-

Deskripsi Fisik

111 hlm. ; 18 cm.

Judul Seri

-

No. Panggil

R 004.03 KRU g

Encyclopedia of portal technologies and applications

No Inv.: 137334,137335/P/Perp/14/2c

McGraw-Hill dictionary of information technology and computer acronyms, initi…

No Inv.: 11730/P/Perp/98/1c

Special topics and techniques : algorithms and theory of computation handbook

No Inv.: 138932, 138933/P/Perp/14/2c

General concepts and techniques : algorithms and theory of computation handbook

Termasuk Bibliografi No Inv.: 138936, 138937/P/Perp/14/2c

Database engine

Bibliografi : hlm. 469; No Inv.: 137489-137493/P/Perp/14/5c

Emerging intelligent computing technology and applications

"This book constitutes the refereed proceedings of the 9th International Conference on Intelligent Computing, ICIC 2013, held in Nanning, China, in July 2013. The 192 revised full papers presented in the three volumes LNCS 7995, LNAI 7996, and CCIS 375 were carefully reviewed and selected from 561 submissions. The papers in this volume (CCIS 375) are organized in topical sections on Neural Netw…

High performance computing

This book constitutes the refereed proceedings of the National Annual Conference on High Performance Computing, HPC 2012, held in Zhangjiajie, China, in October 2012. The 14 revised full papers presented were carefully reviewed and selected from 260 submissions. The papers address issues such as parallel architecture, GPU computing, resource scheduling, parallel algorithm, and performance evalu…

Combinatorial search: From algorithms to systems

Although they are believed to be unsolvable in general, tractability results suggest that some practical NP-hard problems can be efficiently solved. Combinatorial search algorithms are designed to efficiently explore the usually large solution space of these instances by reducing the search space to feasible regions and using heuristics to efficiently explore these regions. Various mathematical…