Search results for "Java Exercises with Data Structures and Algorithms"
Items we need to order for you
R 2,211.00
Genetic Programming and Data Structures
Computers that `program themselves' has long been an aim of computer scientists. Recently genetic programming (GP) has started to show its promise by automatically evolving programs. Indeed in a small number of problems GP has evolved programs whose performance is similar to or even slightly better than that of programs written by people. The main thrust of GP has been to automatically create functions. While these can be of great use they contain no memory and relatively little work has addressed automatic creation of program code including stored data. This issue is the main focus of Genetic Programming, and Data Structures: Genetic Programming + Data Structures = Automatic Programming!. This book is motivated by the observation from software engineering that data abstraction (e.g., via abstract data types) is essential in programs created by human programmers. This book shows that abstract data types can be similarly beneficial to the automatic production of programs using GP. Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming! shows how abstract data types (stacks, queues and lists) can be evolved using genetic programming, demonstrates how GP can evolve general programs which solve the nested brackets problem, recognises a Dyck context free language, and implements a simple four function calculator. In these cases, an appropriate data structure is beneficial compared to simple indexed memory. This book also includes a survey of GP, with a critical review of experiments with evolving memory, and reports investigations of real world electrical network maintenance scheduling problems that demonstrate that Genetic Algorithms can find low cost viable solutions to such problems. Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming! should be of direct interest to computer scientists doing research on genetic programming, genetic algorithms, data structures, and artificial intelligence. In addition, this book will be of interest to practitioners working in all of these areas and to those interested in automatic programming.
R 4,653.57
Mining of Data with Complex Structures
Mining of Data with Complex Structures:- Clarifies the type and nature of data with complex structure including sequences, trees and graphs- Provides a detailed background of the state-of-the-art of sequence mining, tree mining and graph mining.- Defines the essential aspects of the tree mining problem: subtree types, support definitions, constraints.- Outlines the implementation issues one needs to consider when developing tree mining algorithms (enumeration strategies, data structures, etc.)- Details the Tree Model Guided (TMG) approach for tree mining and provides the mathematical model for the worst case estimate of complexity of mining ordered induced and embedded subtrees.- Explains the mechanism of the TMG framework for mining ordered/unordered induced/embedded and distance-constrained embedded subtrees.- Provides a detailed comparison of the different tree mining approaches highlighting the characteristics and benefits of each approach.- Overviews the implications and potential applications of tree mining in general knowledge management related tasks, and uses Web, health and bioinformatics related applications as case studies.- Details the extension of the TMG framework for sequence mining- Provides an overview of the future research direction with respect to technical extensions and application areasThe primary audience is 3rd year, 4th year undergraduate students, Masters and PhD students and academics. The book can be used for both teaching and research. The secondary audiences are practitioners in industry, business, commerce, government and consortiums, alliances and partnerships to learn how to introduce and efficiently make use of the techniques for mining of data with complex structures into their applications. The scope of the book is both theoretical and practical and as such it will reach a broad market both within academia and industry. In addition, its subject matter is a rapidly emerging field that is critical for efficient analysis of knowledge stored in various domains.
R 4,661.34
Data Structures for Raster Graphics
Raster graphics differs from the more traditional vector or line graphics in the sense that images are not made up from line segments but from discrete elements orderly arranged in a two-dimensional rectangular region. There are two reasons for the growing popularity of raster graphics or bit-mapped displays: I) the possibilities they offer to show extremely realistic pictures 2) the dropping prices of those displays and associated processors and memories. With the rise of raster graphics, all kinds of new techniques, methods, algorithms and data representations are associated -such as ray tracing, raster operations, and quadtrees-bringing with them a lot of fruitful research. As stated above raster graphics allows to create extremely realistic (synthesized) pictures. There are important applications in such diverse areas as industrial deSign, flight Simulation, education, image processing and animation. Unfortunately many applications are hampered by the fact that with the present state of the art they reqUire an excessive amount of computing resources. Hence it is worthwhile to investigate methods and techniques which may be of help in redudng computer costs associated with raster graphics applications. Since the choice of data srtuc tures influences the efficiency of algorithms in a crudal way, a workshop was set up in order to bring together a (limited) number of experienced researchers to dis cuss this topic. The workshop was held from 24 to 28 June 1985 at Steensel, a tiny village in the neighbourhood of Eindhoven, the Netherlands.
R 4,335.32
Algorithms and Complexity
The papers in this volume were presented at the Fourth Italian Conference on Algorithms and Complexity (CIAC 2000). The conference took place on March 1-3, 2000, in Rome (Italy), at the conference center of the University of Rome \La Sapienza". This conference was born in 1990 as a national meeting to be held every three years for Italian researchers in algorithms, data structures, complexity, and parallel and distributed computing. Due to a signi cant participation of foreign reaserchers, starting from the second conference, CIAC evolved into an international conference. In response to the call for papers for CIAC 2000, there were 41 subm- sions, from which the program committee selected 21 papers for presentation at the conference. Each paper was evaluated by at least three program committee members. In addition to the selected papers, the organizing committee invited Giorgio Ausiello, Narsingh Deo, Walter Ruzzo, and Shmuel Zaks to give plenary lectures at the conference. We wish to express our appreciation to all the authors of the submitted papers, to the program committee members and the referees, to the organizing committee, and to the plenary lecturers who accepted our invitation.
R 1,561.22
R 3,777.62
R 1,713.92
Microcomputer Algorithms
Although the computing facilities available to scientists are becoming more powerful, the problems they are addressing are increasingly complex. The mathematical methods for simplifying the computing procedures are therefore as important as ever. Microcomputer Algorithms: Action from Algebra stresses the mathematical basis behind the use of many algorithms of computational mathematics, providing detailed descriptions on how to generate algorithms for a large number of different uses. Covering a wide range of mathematical and physical applications, the book contains the theory of 25 algorithms. The mathematical theory for each algorithm is described in detail prior to discussing the algorithm in full, with complete program listings. The book presents the algorithms in modular form, allowing for easy interpretation, for the adaptation to readers' specific requirements without difficulty, and for use with various microcomputers. Blending mathematics and programming in one volume, this book will be of broad interest to all scientists and engineers, particularly those physicists using microcomputers for scientific problem handling. Students handling numerical data for research projects will also find the book useful.
R 2,950.95
Gems of Combinatorial Optimization and Graph Algorithms
Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory? Maybe you need a convenient source of relevant, current topics for a graduate student or advanced undergraduate student seminar? Or perhaps you just want an enjoyable look at some beautiful mathematical and algorithmic results, ideas, proofs, concepts, and techniques in discrete mathematics and theoretical computer science? Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas. Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks. This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.
R 2,564.00
R 2,097.00
Programming GPS and OpenStreetMap Applications with Java
Written by an expert in the development of GPS systems with digital maps and navigation, Programming GPS and OpenStreetMap Applications with Java: The RealObject Application Framework provides a concrete paradigm for object-oriented modeling and programming. It presents a thorough introduction to the use of available global positioning data for the development of applications involving digital maps. The author first describes the different formats of GPS data and digital maps and shows how to use recorded GPS traces to replay and display this data on a digital map. Then, he works through in detail the processing steps of obtaining dedicated data from OpenStreetMaps and how to extract a network for a simple navigation application. For each topic covered—GPS data, OpenStreetMaps, and navigation—Java code is developed that can easily be adapted to the readers’ needs and locality.Finally, all components are put together in a sample computer-game application modeled on the well-known board game, Scotland Yard. The computer game is intended to be a basis from which readers can develop and customize their own application for their desired geographical area. The developed application can be "published" on the Internet and made available for interactive multiplayer competition.This book provides a fun and interesting way to learn distributed programming with Java and real-world data. Open-source software is available on a companion website at www.roaf.de
R 3,370.00
Python Data Structures Pocket Primer
As part of the best-selling Pocket Primer series, this book is designed to present the fundamentals of data structures using Python. Data structures provide a means to managing huge amounts of information such as large databases and the ability to use search and sort algorithms effectively. It is intended to be a fast-paced introduction to the core concepts of Python and data structures, illustrated with numerous code samples. Companion files with source code are available for downloading.
R 911.00
Introduction to the Design and Analysis of Algorithms
Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal treatment while thoroughly covering the material required in an introductory algorithms course. Popular puzzles are used to motivate students' interest and strengthen their skills in algorithmic problem solving. Other learning-enhancement features include chapter summaries, hints to the exercises, and a detailed solution manual.
R 6,473.00
R 764.00
Algorithms on Trees and Graphs
Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, such as approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased attention from computational molecular biology and computational chemistry. Centered around the fundamental issue of graph isomorphism, this text goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. This book introduces graph algorithms on an intuitive basis followed by a detailed exposition in a literate programming style, with correctness proofs as well as worst-case analyses. Furthermore, full C++ implementations of all algorithms presented are given using the LEDA library of efficient data structures and algorithms.
R 2,564.00
Purely Functional Data Structures
Most books on data structures assume an imperative language like C or C++. However, data structures for these languages do not always translate well to functional languages such as Standard ML, Haskell, or Scheme. This book describes data structures from the point of view of functional languages, with examples, and presents design techniques so that programmers can develop their own functional data structures. It includes both classical data structures, such as red-black trees and binomial queues, and a host of new data structures developed exclusively for functional languages. All source code is given in Standard ML and Haskell, and most of the programs can easily be adapted to other functional languages. This handy reference for professional programmers working with functional languages can also be used as a tutorial or for self-study.
R 4,288.61
Compact Data Structures
Compact data structures help represent data in reduced space while allowing it to be queried, navigated, and operated in compressed form. They are essential tools for efficiently handling massive amounts of data by exploiting the memory hierarchy. They also reduce the resources needed in distributed deployments and make better use of the limited memory in low-end devices. The field has developed rapidly, reaching a level of maturity that allows practitioners and researchers in application areas to benefit from the use of compact data structures. This first comprehensive book on the topic focuses on the structures that are most relevant for practical use. Readers will learn how the structures work, how to choose the right ones for their application scenario, and how to implement them. Researchers and students in the area will find in the book a definitive guide to the state of the art in compact data structures.
R 3,633.00
Guide to Graph Algorithms
This book A Guide to Graph Algorithms offers high-quality content in the research area of graph algorithms and explores the latest developments in graph algorithmics. The reader will gain a comprehensive understanding of how to use algorithms to explore graphs. It is a collection of texts that have proved to be trend setters and good examples of that. The book aims at providing the reader with a deep understanding of the structural properties of graphs that are useful for the design of efficient algorithms. These algorithms have applications in finite state machine modelling, social network theory, biology, and mathematics. The book contains many exercises, some up at present-day research-level. The exercises encourage the reader to discover new techniques by putting things in a clear perspective. A study of this book will provide the reader with many powerful tools to model and tackle problems in real-world scenarios.
R 2,381.00
Algorithms
An accessible introduction to algorithms, explaining not just what they are but how they work, with examples from a wide range of application areas.Digital technology runs on algorithms, sets of instructions that describe how to do something efficiently. Application areas range from search engines to tournament scheduling, DNA sequencing, and machine learning. Arguing that every educated person today needs to have some understanding of algorithms and what they do, in this volume in the MIT Press Essential Knowledge series, Panos Louridas offers an introduction to algorithms that is accessible to the nonspecialist reader. Louridas explains not just what algorithms are but also how they work, offering a wide range of examples and keeping mathematics to a minimum. After discussing what an algorithm does and how its effectiveness can be measured, Louridas covers three of the most fundamental applications areas: graphs, which describe networks, from eighteenth-century problems to today's social networks; searching, and how to find the fastest way to search; and sorting, and the importance of choosing the best algorithm for particular tasks. He then presents larger-scale applications: PageRank, Google's founding algorithm; and neural networks and deep learning. Finally, Louridas describes how all algorithms are nothing more than simple moves with pen and paper, and how from such a humble foundation rise all their spectacular achievements.
R 387.00
VLSI Architecture for Concurrent Data Structures
Concurrent data structures simplify the development of concurrent programs by encapsulating commonly used mechanisms for synchronization and commu nication into data structures. This thesis develops a notation for describing concurrent data structures, presents examples of concurrent data structures, and describes an architecture to support concurrent data structures. Concurrent Smalltalk (CST), a derivative of Smalltalk-80 with extensions for concurrency, is developed to describe concurrent data structures. CST allows the programmer to specify objects that are distributed over the nodes of a concurrent computer. These distributed objects have many constituent objects and thus can process many messages simultaneously. They are the foundation upon which concurrent data structures are built. The balanced cube is a concurrent data structure for ordered sets. The set is distributed by a balanced recursive partition that maps to the subcubes of a binary 7lrcube using a Gray code. A search algorithm, VW search, based on the distance properties of the Gray code, searches a balanced cube in O(log N) time. Because it does not have the root bottleneck that limits all tree-based data structures to 0(1) concurrency, the balanced cube achieves 0C.:N) con currency. Considering graphs as concurrent data structures, graph algorithms are pre sented for the shortest path problem, the max-flow problem, and graph parti tioning. These algorithms introduce new synchronization techniques to achieve better performance than existing algorithms.
R 4,648.40
Algorithms - ESA 2001
This book constitutes the refereed proceedings of the 9th Annual European Symposium on Algorithms, ESA 2001, held in Aarhus, Denmark, in August 2001.The 41 revised full papers presented together with three invited contributions were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections on caching and prefetching, online algorithms, data structures, optimization and approximation, sequences, scheduling, shortest paths, geometry, distributed algorithms, graph algorithms, pricing, broadcasting and multicasting, graph labeling and graph drawing, and graphs.
R 1,597.51
R 5,297.00
R 764.00
Algorithms and Complexity
This book constitutes the refereed proceedings of the 13th International Conference on Algorithms and Complexity, CIAC 2023, which took place in Larnaca, Cyprus, during June 13–16, 2023. The 25 full papers included in this book were carefully reviewed and selected from 49 submissions. They cover all important areas of research on algorithms and complexity such as algorithm design and analysis; sequential, parallel and distributed algorithms; data structures; computational and structural complexity; lower bounds and limitations of algorithms; randomized and approximation algorithms; parameterized algorithms and parameterized complexity classes; smoothed analysis of algorithms; alternatives to the worst-case analysis of algorithms (e.g., algorithms with predictions), on-line computation and competitive analysis, streaming algorithms, quantum algorithms and complexity, algorithms in algebra, geometry, number theory and combinatorics, computational geometry, algorithmic game theory and mechanism design, algorithmic economics (including auctions and contests), computational learning theory, computational biology and bioinformatics, algorithmic issues in communication networks, algorithms for discrete optimization (including convex optimization) and algorithm engineering.
R 3,337.05
R 1,527.00
Algorithms and Complexity
The papers in this volume were presented at the 5th Italian Conference on AlgorithmsandComplexity(CIAC2003). Theconferencetookplaceduring May 28-30, 2003, in Rome, Italy, at the Conference Centre of the University of Rome "La Sapienza. " CIAC started in 1990 as a national meeting to be held every three years for Italian researchers in algorithms, data structures, complexity theory, and parallelanddistributedcomputing. Duetoasigni?cantparticipationofforeign researchers, starting from the second edition, CIAC evolved into an international conference. However,alltheeditionsofCIAChavebeenheldinRome. The proceedings of CIAC were published by World Scienti?c for the ?rst edition and by Springer-Verlag in the Lecture Notes in Computer Science series (volumes 778,1203and1767)forthesubsequenteditions. Aselectionofthepapersofthe fourth edition was published in a special issue of Theoretical Computer Science Vol. 285(1),2002. Thisyearweexpecttopublishanextendedversionofselected papers presented at the conference in a special issue of the journal Theory of Computing Systems.In response to the call for papers for CIAC 2003, 57 papers were subm- ted, from which the Program Committee selected 23 papers for presentation at theconferencefrom18countries. Eachpaperwasevaluatedbyatleastthree Program Committee members with the help of 63 external reviewers. In addition to the selected papers, the Organizing Committee invited CharlesE. Leiserson(Cambridge),DavidPeleg(Rehovot),MichaelO. Rabin (CambridgeandJerusalem),JohnE. Savage(Providence),andLucaTrevisan (Berkeley)togiveplenarylecturesattheconference. Moreover,threetutorials byDavidPeleg,JaymeL. Szwarc?ter(RiodeJaneiro)andLucaTrevisanwere o?ered in the days preceding the conference. We wish to express our appreciation to all the authors of the submitted - pers, to the Program Committee members and the referees, to the Organizing Committee, and to the plenary and tutorial lecturers who accepted our in- tation.
R 2,015.00
Algorithms and Order
This volume contains the texts of the principal survey papers presented at ALGORITHMS -and ORDER, held· at Ottawa, Canada from June 1 to June 12, 1987. The conference was supported by grants from the N.A.T.O. Advanced Study Institute programme, the University of Ottawa, and the Natural Sciences and Engineering Research Council of Canada. We are grateful for this considerable support. Over fifty years ago, the Symposium on Lattice Theory, in Charlottesville, U.S.A., proclaimed the vitality of ordered sets. Only twenty years later the Symposium on Partially Ordered Sets and Lattice Theory, held at Monterey, U.S.A., had solved many of the problems that had been originally posed. In 1981, the Symposium on Ordered Sets held at Banff, Canada, continued this tradition. It was marked by a landmark volume containing twenty-three articles on almost all current topics in the theory of ordered sets and its applications. Three years after, Graphs and Orders, also held at Banff, Canada, aimed to document the role of graphs in the theory of ordered sets and its applications. Because of its special place in the landscape of the mathematical sciences order is especially sensitive to new trends and developments. Today, the most important current in the theory and application of order springs from theoretical computer seience. Two themes of computer science lead the way. The first is data structure. Order is common to data structures.
R 12,230.64
Experimental Algorithms
This volume contains the papers presented at the 8th International Symposium on Experimental Algorithms (SEA 2009).The symposium was held at the Te- nische Universit. at Dortmund, Germany, during June 4-6, 2009. The main theme of the SEA series is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. Contributions are supported by experimental evaluation, methodological issues in the design and interpretation of experiments, the use of (meta-)heuristics, or application-driven case studies that deepen the und- standing of a problem's complexity. For each symposium, papers are solicited from all areas of algorithmic engineering research. Previous meetings, under the name of "Workshop on Experimental Al- rithms" (WEA), were held in Riga (Latvia, 2001), Ascona (Switzerland, 2003), Angra dos Reis (Brazil, 2004), Santorini (Greece, 2005), Menorca Island (Spain, 2006), Rome (Italy, 2007), and Provincetown (USA, 2008). The ProgramCommittee ofSEA 2009received64 submissions.Eachsubm- sion was reviewed by at least three ProgramCommittee members and evaluated on its quality,originality,and relevance to the symposium.Overall,the Program Committee wrote249 reviews with the help of almost 100 trusted external ref- ees. The Committee selected 23 papers, leading to an acceptance rate of 35.9%. The decision process was made electronically using the EasyChair conference management system. In additionto the accepted contributions,this volumealso containsabstracts ofthe invitedtalks givenby Heinz Bast(Intel), MichaelA. Bender (Stony Brook University and Tokutek, Inc.), and Marc Schoenauer (INRIA Saclay - Ile-de- France).
R 2,365.14
Combinatorial Algorithms
This book constitutes the thoroughly refereed post-workshop proceedings of the 25th International Workshop on Combinatorial Algorithms, IWOCA 2014, held in Duluth, MN, USA, in October 2014. The 32 revised full papers presented were carefully reviewed and selected from a total of 69 submissions. The papers focus on topics such as Algorithms and Data Structures, Combinatorial Enumeration, Combinatorial Optimization, Complexity Theory (Structural and Computational), Computational Biology, Databases (Security, Compression and Information Retrieval), Decompositions and Combinatorial Designs, Discrete and Computational Geometry, as well as Graph Drawing and Graph Theory. IWOCA is a yearly forum for researchers in designing algorithms field to advance creativeness of intersection between mathematics and computer science. This is the first time this conference is being held in U.S.
R 2,188.29
Handbook of Applied Algorithms
Discover the benefits of applying algorithms to solve scientific, engineering, and practical problems Providing a combination of theory, algorithms, and simulations, Handbook of Applied Algorithms presents an all-encompassing treatment of applying algorithms and discrete mathematics to practical problems in "hot" application areas, such as computational biology, computational chemistry, wireless networks, and computer vision. In eighteen self-contained chapters, this timely book explores: * Localized algorithms that can be used in topology control for wireless ad-hoc or sensor networks * Bioinformatics algorithms for analyzing data * Clustering algorithms and identification of association rules in data mining * Applications of combinatorial algorithms and graph theory in chemistry and molecular biology * Optimizing the frequency planning of a GSM network using evolutionary algorithms * Algorithmic solutions and advances achieved through game theory Complete with exercises for readers to measure their comprehension of the material presented, Handbook of Applied Algorithms is a much-needed resource for researchers, practitioners, and students within computer science, life science, and engineering. Amiya Nayak, PhD, has over seventeen years of industrial experience and is Full Professor at the School of Information Technology and Engineering at the University of Ottawa, Canada. He is on the editorial board of several journals. Dr. Nayak's research interests are in the areas of fault tolerance, distributed systems/algorithms, and mobile ad-hoc networks. Ivan StojmenoviC?, PhD, is Professor at the University of Ottawa, Canada (www.site.uottawa.ca/~ivan), and Chair Professor of Applied Computing at the University of Birmingham, United Kingdom. Dr. Stojmenovic? received the Royal Society Wolfson Research Merit Award. His current research interests are mostly in the design and analysis of algorithms for wireless ad-hoc and sensor networks.
R 5,209.00
Beginner's Guide to Code Algorithms
Do you have creative ideas that you wish you could transform into code?Do you want to boost your problem solving and logic skills?Do you want to enhance your career by adopting an algorithmic mindset?In our increasingly digital world, coding is an essential skill. Communicating an algorithm to a machine to perform a set of tasks is vital. Beginner’s Guide to Code Algorithms: Experiments to Enhance Productivity and Solve Problems written by Deepankar Maitra teaches you how to think like a programmer. The author unravels the secret behind writing code – building a good algorithm. Algorithmic thinking leads to asking the right question and enables a shift from issue resolution to value creation. Having this mindset will make you more marketable to employers. This book takes you on a problem-solving journey to expand your mind and increase your willingness to experiment with code. You will: Learn the art of building an algorithm through hands-on exercises Understand how to develop code for inspiring productivity concepts Build a mentality of developing algorithms to solve problems Develop, test, review, and improve code through guided experimentationThis book is designed to develop a culture of logical thinking through intellectual stimulation. It will benefit students and teachers of programming, business professionals, as well as experienced users of Microsoft Excel who wish to become proficient with macros.
R 2,980.62
Matrices and Simplex Algorithms
This is a textbook devoted to mathematical programming algorithms and the mathematics needed to understand such algorithms. It was mainly written for economists, but the mathematics itself obviously has relevance for other disciplines. It is a textbook as well a~ in parts, a contribution to new knowledge. There is, accordingly, a broad ordering of climbing sophistication, the earlier chapters being purely for the student, the later chapters being more specialist and containing some element of novelty on certain points. The book is edited in five parts. Part I deals with elementary matrix operations, matrix inversion, determinants, etc. Part II is mainly devoted to linear programming. As far as students' readability is concerned, these two parts are elementary undergraduate material. However, I would claim, in particular with respect to linear programming, that I do things more efficiently than the standard textbook approach has it. This refers mainly to the search for a feasible solution i.e. Chapter 9, and to upper and lower limits, i.e. Chapter 10. I have also argued that the standard textbook treatment of degeneracy misses a relevant problem, namely that of accuracy. In short, I would invite anyone who has the task of writing or designing an LP-code, to first acquaint himself with my ideas. viii INTRODUCTION Parts III and IV are concerned with nonlinear programming.
R 1,637.77
Algorithms and Computation
This book constitutes the refereed proceedings of the 18th International Symposium on Algorithms and Computation, ISAAC 2007, held in Sendai, Japan, in December 2007. The 77 revised full papers presented together with two invited talks were carefully reviewed and selected from 220 submissions. The papers included topical sections on graph algorithms, computational geometry, complexity, graph drawing, distributed algorithms, optimization, data structure, and game theory.
R 3,143.70
50 Algorithms Every Programmer Should Know - Second Edition
Delve into the realm of generative AI and large language models (LLMs) while exploring modern deep learning techniques, including LSTMs, GRUs, RNNs with new chapters included in this 50% new edition overhaulPurchase of the print or Kindle book includes a free eBook in PDF format.Key FeaturesFamiliarize yourself with advanced deep learning architecturesExplore newer topics, such as handling hidden bias in data and algorithm explainabilityGet to grips with different programming algorithms and choose the right data structures for their optimal implementationBook DescriptionThe ability to use algorithms to solve real-world problems is a must-have skill for any developer or programmer. This book will help you not only to develop the skills to select and use an algorithm to tackle problems in the real world but also to understand how it works.You'll start with an introduction to algorithms and discover various algorithm design techniques, before exploring how to implement different types of algorithms, with the help of practical examples. As you advance, you'll learn about linear programming, page ranking, and graphs, and will then work with machine learning algorithms to understand the math and logic behind them.Case studies will show you how to apply these algorithms optimally before you focus on deep learning algorithms and learn about different types of deep learning models along with their practical use.You will also learn about modern sequential models and their variants, algorithms, methodologies, and architectures that are used to implement Large Language Models (LLMs) such as ChatGPT.Finally, you'll become well versed in techniques that enable parallel processing, giving you the ability to use these algorithms for compute-intensive tasks.By the end of this programming book, you'll have become adept at solving real-world computational problems by using a wide range of algorithms.What you will learnDesign algorithms for solving complex problemsBecome familiar with neural networks and deep learning techniquesExplore existing data structures and algorithms found in Python librariesImplement graph algorithms for fraud detection using network analysisDelve into state-of-the-art algorithms for proficient Natural Language Processing illustrated with real-world examplesCreate a recommendation engine that suggests relevant movies to subscribersGrasp the concepts of sequential machine learning models and their foundational role in the development of cutting-edge LLMsWho this book is forThis computer science book is for programmers or developers who want to understand the use of algorithms for problem-solving and writing efficient code.Whether you are a beginner looking to learn the most used algorithms concisely or an experienced programmer looking to explore cutting-edge algorithms in data science, machine learning, and cryptography, you'll find this book useful.Python programming experience is a must, knowledge of data science will be helpful but not n
R 2,442.00
Algorithms for Sensor Systems
This book constitutes thoroughly refereed and revised selected papers from the 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2014, held in Wroclaw, Poland, on September 12, 2014.The 10 papers presented in this volume were carefully reviewed and selected from 20 submissions. They are organized in topical sections named: robot planning; algorithms and data structures on graphs; and wireless networks.
R 1,773.29
R 1,270.00
Algorithms: Design Techniques And Analysis
Problem solving is an essential part of every scientific discipline. It has two components: (1) problem identification and formulation, and (2) the solution to the formulated problem. One can solve a problem on its own using ad hoc techniques or by following techniques that have produced efficient solutions to similar problems. This required the understanding of various algorithm design techniques, how and when to use them to formulate solutions, and the context appropriate for each of them.This book presents a design thinking approach to problem solving in computing — by first using algorithmic analysis to study the specifications of the problem, before mapping the problem on to data structures, then on to the situatable algorithms. Each technique or strategy is covered in its own chapter supported by numerous examples of problems and their algorithms. The new edition includes a comprehensive chapter on parallel algorithms, and many enhancements.
R 6,826.53
Automatic Coding: Choice of Data Structures
1.0 2 information structures, and the runtime efficiency available using lower level data structures. We believe these runtime inefficiencies can be remedied by providing a library of representations for the information structures and a user assisted automatic system to choose appropriate elements from this library for the user's programs. The main problems in such an automatic approach are: 1). Building a library of representations; 2). Characterizing the properties of these representations; 3). understanding how the user's program actually uses the abstract information structures; and -4). efficiently matching the user program needs with the properties of the known representations. The research reported here is an attempt to demonstrate the feasibility of such automatic representation selection. We allow the user to express data in terms of relations, sets, and sequences. Our system then obtains information by analysis of the program, execution statement profiles and interrogation of the user. Using that information, the system selects efficient (in terms of time and space) low level implementations for the user's information structures from a fixed library of information structure representations. Though we have considered only a few abstract information structures (those available in our programming language, SAIL) we believe the techniques used in this system are generally applicable.
R 1,254.00
Learning Algorithms
When it comes to writing efficient code, every software professional needs to have an effective working knowledge of algorithms. In this practical book, author George Heineman (Algorithms in a Nutshell) provides concise and informative descriptions of key algorithms that improve coding. Software developers, testers, and maintainers will discover how algorithms solve computational problems creatively.Each chapter builds on earlier chapters through eye-catching visuals and a steady rollout of essential concepts, including an algorithm analysis to classify the performance of every algorithm presented in the book. At the end of each chapter, you'll get to apply what you've learned to a novel challenge problem -- simulating the experience you might find in a technical code interview.With this book, you will:Examine fundamental algorithms central to computer science and software engineeringLearn common strategies for efficient problem solving -- such as divide and conquer, dynamic programming, and greedy approachesAnalyze code to evaluate time complexity using big O notationUse existing Python libraries and data structures to solve problems using algorithmsUnderstand the main steps of important algorithms
R 1,824.00
Introduction To The Analysis Of Algorithms, An (2nd Edition)
A successor to the first edition, this updated and revised book is a great companion guide for students and engineers alike, specifically software engineers who design reliable code. While succinct, this edition is mathematically rigorous, covering the foundations of both computer scientists and mathematicians with interest in algorithms.Besides covering the traditional algorithms of Computer Science such as Greedy, Dynamic Programming and Divide & Conquer, this edition goes further by exploring two classes of algorithms that are often overlooked: Randomised and Online algorithms — with emphasis placed on the algorithm itself. The coverage of both fields are timely as the ubiquity of Randomised algorithms are expressed through the emergence of cryptography while Online algorithms are essential in numerous fields as diverse as operating systems and stock market predictions.While being relatively short to ensure the essentiality of content, a strong focus has been placed on self-containment, introducing the idea of pre/post-conditions and loop invariants to readers of all backgrounds. Containing programming exercises in Python, solutions will also be placed on the book's website.
R 2,121.17
Designing Hexagonal Architecture with Java
A practical guide for software architects and Java developers to build cloud-native hexagonal applications using Java and Quarkus to create systems that are easier to refactor, scale, and maintainKey FeaturesLearn techniques to decouple business and technology code in an applicationApply hexagonal architecture principles to produce more organized, coherent, and maintainable softwareMinimize technical debts and tackle complexities derived from multiple teams dealing with the same code baseBook DescriptionHexagonal architecture enhances developers' productivity by decoupling business code from technology code, making the software more change-tolerant, and allowing it to evolve and incorporate new technologies without the need for significant refactoring. By adhering to hexagonal principles, you can structure your software in a way that reduces the effort required to understand and maintain the code.This book starts with an in-depth analysis of hexagonal architecture's building blocks, such as entities, use cases, ports, and adapters. You'll learn how to assemble business code in the Domain hexagon, create features by using ports and use cases in the Application hexagon, and make your software compatible with different technologies by employing adapters in the Framework hexagon. Moving on, you'll get your hands dirty developing a system based on a real-world scenario applying all the hexagonal architecture's building blocks. By creating a hexagonal system, you'll also understand how you can use Java modules to reinforce dependency inversion and ensure the isolation of each hexagon in the architecture. Finally, you'll get to grips with using Quarkus to turn your hexagonal application into a cloud-native system.By the end of this hexagonal architecture book, you'll be able to bring order and sanity to the development of complex and long-lasting applications.What you will learnFind out how to assemble business rules algorithms using the specification design patternCombine domain-driven design techniques with hexagonal principles to create powerful domain modelsEmploy adapters to make the system support different protocols such as REST, gRPC, and WebSocketCreate a module and package structure based on hexagonal principlesUse Java modules to enforce dependency inversion and ensure isolation between software componentsImplement Quarkus DI to manage the life cycle of input and output portsWho this book is forThis book is for software architects and Java developers who want to improve code maintainability and enhance productivity with an architecture that allows changes in technology without compromising business logic, which is precisely what hexagonal architecture does. Intermediate knowledge of the Java programming language and familiarity with Jakarta EE will help you to get the most out of this book.
R 1,596.00
Experimental and Efficient Algorithms
The Third International Workshop on Experimental and E?cient Algorithms (WEA 2004) was held in Angra dos Reis (Brazil), May 25-28, 2004. TheWEAworkshopsaresponsoredbytheEuropeanAssociationforTheo- tical Computer Science (EATCS). They are intended to provide an international forum for researchers in the areas of design, analysis, and experimental eval- tion of algorithms. The two preceding workshops in this series were held in Riga (Latvia, 2001) and Ascona (Switzerland, 2003). This proceedings volume comprises 40 contributed papers selected by the Program Committee along with the extended abstracts of the invited lectures presentedbyRichardKarp(UniversityofCaliforniaatBerkeley,USA),Giuseppe Italiano (University of Rome "Tor Vergata", Italy), and Christos Kaklamanis (University of Patras, Greece). As the organizer and chair of this wokshop, I would like to thank all the authors who generously supported this project by submitting their papers for publication in thisvolume. Iamalso grateful to theinvited lecturers, who kindly accepted our invitation.For their dedication and collaboration in the refereeing procedure, I would like also to express my gratitude to the members of the Program Committee: E. Amaldi (Italy), J. Blazewicz (Poland), V.-D. Cung (France), U. Derigs (G- many), J. Diaz (Spain), M. Gendreau (Canada), A. Goldberg (USA), P. Hansen (Canada), T. Ibaraki (Japan), K. Jansen (Germany), S. Martello (Italy), C.C. McGeoch (USA), L.S. Ochi (Brazil), M.G.C. Resende (USA), J. Rolim (Sw- zerland), S. Skiena (USA), M. Sniedovich (Australia), C.C. Souza (Brazil), P.
R 1,604.71
Algorithms –- ESA 2012
This book constitutes the refereed proceedings of the 20th Annual European Symposium on Algorithms, ESA 2012, held in Ljubljana, Slovenia, in September 2012 in the context of the combined conference ALGO 2012. The 69 revised full papers presented were carefully reviewed and selected from 285 initial submissions: 56 out of 231 in track design and analysis and 13 out of 54 in track engineering and applications. The papers are organized in topical sections such as algorithm engineering; algorithmic aspects of networks; algorithmic game theory; approximation algorithms; computational biology; computational finance; computational geometry; combinatorial optimization; data compression; data structures; databases and information retrieval; distributed and parallel computing; graph algorithms; hierarchical memories; heuristics and meta-heuristics; mathematical programming; mobile computing; on-line algorithms; parameterized complexity; pattern matching, quantum computing; randomized algorithms; scheduling and resource allocation problems; streaming algorithms.
R 2,264.11
R 1,293.00
Applied Algorithms
This book constitutes the refereed proceedings of the First International Conference on Applied Algorithms, ICAA 2014, held in Kolkata, India, in January 2014. ICAA is a new conference series with a mission to provide a quality forum for researchers working in applied algorithms. Papers presenting original contributions related to the design, analysis, implementation and experimental evaluation of efficient algorithms and data structures for problems with relevant real-world applications were sought, ideally bridging the gap between academia and industry. The 21 revised full papers presented together with 7 short papers were carefully reviewed and selected from 122 submissions.
R 2,175.34
R 608.00
R 1,527.00
