You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
The book addresses the complex relationships among learning, education and the community. It examines the significance of the community for the individual’s development and the potential that learning and education have for the development of the community. The volume gathers together the findings of a number of quantitative and qualitative studies conducted on different samples, theoretical discussions set in comparative international contexts. Although the studies employ Slovenian samples and analyse situations in this country, the contributions address issues that are of concern to the global research community. Moreover, they respond to international debates and engage in the dialogue between the local/partial and the global/universal. The book is unique in its embeddedness in the intellectual continental European tradition that has been characterised by the failed historical experience of attempting collective unity through the community understood as a common identity in former Yugoslavia.
Advancements in microprocessor architecture, interconnection technology, and software development have fueled rapid growth in parallel and distributed computing. However, this development is only of practical benefit if it is accompanied by progress in the design, analysis and programming of parallel algorithms. This concise textbook provides, in one place, three mainstream parallelization approaches, Open MPP, MPI and OpenCL, for multicore computers, interconnected computers and graphical processing units. An overview of practical parallel computing and principles will enable the reader to design efficient parallel programs for solving various computational problems on state-of-the-art personal computers and computing clusters. Topics covered range from parallel algorithms, programming tools, OpenMP, MPI and OpenCL, followed by experimental measurements of parallel programs’ run-times, and by engineering analysis of obtained results for improved parallel execution performances. Many examples and exercises support the exposition.
Most na Soči sodi med najpomembnejša prazgodovinska najdišča Evrope. Znano je postalo zlasti po veliki nekropoli iz starejše železne dobe, ki so jo raziskovali ob koncu devetnajstega stoletja in na kateri so izkopali čez 6000 grobov. Hiter razvoj kraja je v sedemdesetih letih prejšnjega stoletja vzpodbudil ponovna arheološka izkopavanja. Trajala so enajst let, v tem času pa je bilo na območju današnje vasi temeljito raziskano eno najpomembnejših železnodobnih naselij ne le pri nas temveč tudi na širšem jugovzhodnoalpskem prostoru. Na začetku monografije je podan geografski oris kraja, temu pa sledi izčrpna zgodovina raziskovanj, ki ji je dodan seznam dosedanjih objav. V os...
None
Since its creation in 1884, Engineering Index has covered virtually every major engineering innovation from around the world. It serves as the historical record of virtually every major engineering innovation of the 20th century. Recent content is a vital resource for current awareness, new production information, technological forecasting and competitive intelligence. The world?s most comprehensive interdisciplinary engineering database, Engineering Index contains over 10.7 million records. Each year, over 500,000 new abstracts are added from over 5,000 scholarly journals, trade magazines, and conference proceedings. Coverage spans over 175 engineering disciplines from over 80 countries. Updated weekly.
None
None
This is the first book to fully address the study of approximation algorithms as a tool for coping with intractable problems. With chapters contributed by leading researchers in the field, this book introduces unifying techniques in the analysis of approximation algorithms. APPROXIMATION ALGORITHMS FOR NP-HARD PROBLEMS is intended for computer scientists and operations researchers interested in specific algorithm implementations, as well as design tools for algorithms. Among the techniques discussed: the use of linear programming, primal-dual techniques in worst-case analysis, semidefinite programming, computational geometry techniques, randomized algorithms, average-case analysis, probabilistically checkable proofs and inapproximability, and the Markov Chain Monte Carlo method. The text includes a variety of pedagogical features: definitions, exercises, open problems, glossary of problems, index, and notes on how best to use the book.