Search results for "Data Structures and Algorithms in Java"
Items we need to order for you
Robustness and Complex Data Structures
This Festschrift in honour of Ursula Gather’s 60th birthday deals with modern topics in the field of robust statistical methods, especially for time series and regression analysis, and with statistical methods for complex data structures. The individual contributions of leading experts provide a textbook-style overview of the topic, supplemented by current research results and questions. The statistical theory and methods in this volume aim at the analysis of data which deviate from classical stringent model assumptions, which contain outlying values and/or have a complex structure. Written for researchers as well as master and PhD students with a good knowledge of statistics.
R 4,030.00
Experimental and Efficient Algorithms
This proceedings volume contains the accepted papers and invited talks p- sented at the 4th International Workshop of E?cient and Experimental Al- rithms (WEA 2005), that was held May 10-13, on Santorini Island, Greece. The WEA events are intended to be an international forum for research on the design, analysis and especially the experimental implementation, evaluation and engineering of algorithms, as well as on combinatorial optimization and its applications. The?rstthreeworkshopsinthisserieswereheldinRiga(2001),MonteVerita (2003) and Rio de Janeiro (2004). Thisvolumecontains3invitedpapersrelatedtocorrespondingkeynotetalks: by Prof. Christos Papadimitriou (University of California at Berkeley, USA), Prof. David Bader (University of New Mexico, USA) and Prof. Celso Ribeiro (University of Rio de Janeiro, Brazil). This proceedings includes 54 papers (47 regular and 7 short), selected out of a record number of 176 submissions. Each paper was reviewed by at least 2 Program Committee members, while many papers got 3 or 4 reviews. A total number of 419 reviews were solicited, with the help of trusted external referees.In addition to the 54 papers included in this volume, 6papers were accepted as poster presentations: these papers were published in a separate poster p- ceedings volume by CTI Press and a major publisher in Greece, "Ellinika Gr- mata." The presentation of these posters at the event was expected to create a fruitful discussion on interesting ideas.
R 3,094.34
Computational Complexity and Local Algorithms
This volume contains a collection of studies in the areas of complexity theory and local algorithms. A common theme in most of the papers is the interplay between randomness and computation. This interplay is pivotal to some parts of complexity theory and is essential for local algorithms.The works included address a variety of topics in the areas of complexity theory and local algorithms. Within complexity theory the topics include approximation algorithms, counting problems, enumeration problems, explicit construction of expander graphs, fine grained complexity, interactive proof systems, PPT-search and pseudodeterminism, space complexity, and worst-case to average-case reductions. Within local algorithms the focus is mostly on property testing and on locally testable and decodable codes. In particular, many of the works seek to advance the study of testing graph properties in the bounded-degree graph model. Other topics in property testing include testing group properties and testing properties of affine subspaces.
R 3,154.45
R 1,527.00
Automating the Design of Data Mining Algorithms
Data mining is a very active research area with many successful real-world app- cations. It consists of a set of concepts and methods used to extract interesting or useful knowledge (or patterns) from real-world datasets, providing valuable support for decision making in industry, business, government, and science. Although there are already many types of data mining algorithms available in the literature, it is still dif cult for users to choose the best possible data mining algorithm for their particular data mining problem. In addition, data mining al- rithms have been manually designed; therefore they incorporate human biases and preferences. This book proposes a new approach to the design of data mining algorithms. - stead of relying on the slow and ad hoc process of manual algorithm design, this book proposes systematically automating the design of data mining algorithms with an evolutionary computation approach. More precisely, we propose a genetic p- gramming system (a type of evolutionary computation method that evolves c- puter programs) to automate the design of rule induction algorithms, a type of cl- si cation method that discovers a set of classi cation rules from data. We focus on genetic programming in this book because it is the paradigmatic type of machine learning method for automating the generation of programs and because it has the advantage of performing a global search in the space of candidate solutions (data mining algorithms in our case), but in principle other types of search methods for this task could be investigated in the future.
R 4,612.37
Computer–Based Structure Elucidation from Spectral Data
Here, the authors introduce readers to solving molecular structure elucidation problems using the expert system ACD/Structure Elucidator. They explain in detail the concepts of the Computer-Assisted Structure Elucidation (CASE) approach and point out the crucial role of understanding the axiomatic nature of the data used to deduce the structure. Aspects covered include the main blocks of the expert system and essential features of the mathematical algorithms used. Graduate and PhD students as well as practicing chemists are provided with a detailed explanation of the various practical approaches depending on available spectral data peculiarities and the complexity of the unknown structure. This is supported by a large number of real-world completed examples, most of which are related to the structure elucidation of natural product molecules containing unusual skeletons. Dedicated software and further supplementary material are available at www.acdlabs.com/TeachingSE.
R 4,030.00
Concurrent Programming: Algorithms, Principles, and Foundations
This book is devoted to the most difficult part of concurrent programming, namely synchronization concepts, techniques and principles when the cooperating entities are asynchronous, communicate through a shared memory, and may experience failures. Synchronization is no longer a set of tricks but, due to research results in recent decades, it relies today on sane scientific foundations as explained in this book.In this book the author explains synchronization and the implementation of concurrent objects, presenting in a uniform and comprehensive way the major theoretical and practical results of the past 30 years. Among the key features of the book are a new look at lock-based synchronization (mutual exclusion, semaphores, monitors, path expressions); an introduction to the atomicity consistency criterion and its properties and a specific chapter on transactional memory; an introduction to mutex-freedom and associated progress conditions such as obstruction-freedom and wait-freedom; a presentation of Lamport's hierarchy of safe, regular and atomic registers and associated wait-free constructions; a description of numerous wait-free constructions of concurrent objects (queues, stacks, weak counters, snapshot objects, renaming objects, etc.); a presentation of the computability power of concurrent objects including the notions of universal construction, consensus number and the associated Herlihy's hierarchy; and a survey of failure detector-based constructions of consensus objects. The book is suitable for advanced undergraduate students and graduate students in computer science or computer engineering, graduate students in mathematics interested in the foundations of process synchronization, and practitioners and engineers who need to produce correct concurrent software. The reader should have a basic knowledge of algorithms and operating systems.
R 3,784.27
Object-Oriented Approach to Problem Solving and Machine Learning with Python
This book is a comprehensive guide suitable for beginners and experienced developers alike. It teaches readers how to master object-oriented programming (OOP) with Python and use it in real-world applications.Start by solidifying your OOP foundation with clear explanations of core concepts such as use cases and class diagrams. This book goes beyond theory as you get practical examples with well-documented source code available in the book and on GitHub.This book doesn’t stop at the basics. Explore how OOP empowers fields such as data persistence, graphical user interfaces (GUIs), machine learning, and data science, including social media analysis. Learn about machine learning algorithms for classification, regression, and unsupervised learning, putting you at the forefront of AI innovation.Each chapter is designed for hands-on learning. You’ll solidify your understanding with case studies, exercises, and projects that apply your newfound knowledge to real-world scenarios. The progressive structure ensures mastery, with each chapter building on the previous one, reinforced by exercises and projects.Numerous code examples and access to the source code enhance your learning experience. This book is your one-stop shop for mastering OOP with Python and venturing into the exciting world of machine learning and data science.
R 5,684.70
Algorithms and Computation
This volume contains the proceedings of the 19th International Symposium on Algorithmsand Computation (ISAAC 2008),held on the Gold Coast, Australia, December 15–17, 2008. In the past, it was held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Daejeon (1998), Chennai (1999), Taipei (2000), Christchurch (2001), Vancouver (2002), Kyoto (2003), Hong Kong (2004), Hainan (2005), Kolkata (2006), and Sendai (2007). ISAACis anannualinternationalsymposiumthatcoversthe verywide range of topics in the ?eld of algorithms and computation. The main purpose of the symposium is to provide a forum for researchers working in algorithms and theoryofcomputationfrom allovertheworld.In responseto ourcallfor papers, we received 229 submissions from 40 countries. The task of selecting the papers in this volume was done by our Program Committee and many other external reviewers. After an extremely rigorous review process and extensive discussion, the Committee selected 78 papers. We hope all accepted papers will eventually appear in scienti?c journals in a more polished form. Two special issues, one of Algorithmica and one of the International Journal on Computational Geometry and Applications, with selected papers from ISAAC 2008 are in preparation.
R 3,146.05
Algorithms for Parallel Processing
This IMA Volume in Mathematics and its Applications ALGORITHMS FOR PARALLEL PROCESSING is based on the proceedings of a workshop that was an integral part of the 1996-97 IMA program on "MATHEMATICS IN HIGH-PERFORMANCE COMPUTING. " The workshop brought together algorithm developers from theory, combinatorics, and scientific computing. The topics ranged over models, linear algebra, sorting, randomization, and graph algorithms and their analysis. We thank Michael T. Heath of University of lllinois at Urbana (Com puter Science), Abhiram Ranade of the Indian Institute of Technology (Computer Science and Engineering), and Robert S. Schreiber of Hewlett Packard Laboratories for their excellent work in organizing the workshop and editing the proceedings. We also take this opportunity to thank the National Science Founda tion (NSF) and the Army Research Office (ARO), whose financial support made the workshop possible. A vner Friedman Robert Gulliver v PREFACE The Workshop on Algorithms for Parallel Processing was held at the IMA September 16 - 20, 1996; it was the first workshop of the IMA year dedicated to the mathematics of high performance computing. The work shop organizers were Abhiram Ranade of The Indian Institute of Tech nology, Bombay, Michael Heath of the University of Illinois, and Robert Schreiber of Hewlett Packard Laboratories. Our idea was to bring together researchers who do innovative, exciting, parallel algorithms research on a wide range of topics, and by sharing insights, problems, tools, and methods to learn something of value from one another.
R 3,052.32
Design and Analysis of Algorithms
This book constitutes the refereed proceedings of the First Mediterranean Conference on Algorithms, MedAlg 2012, held in Kibbutz Ein Gedi, Israel, in December 2012. The 18 papers presented were carefully reviewed and selected from 44 submissions. The conference papers focus on the design, engineering, theoretical and experimental performance analysis of algorithms for problems arising in different areas of computation. Topics covered include: communications networks, combinatorial optimization and approximation, parallel and distributed computing, computer systems and architecture, economics, game theory, social networks and the World Wide Web.
R 2,168.89
Tools and Algorithms for the Construction and Analysis of Systems
This open access book constitutes the proceedings of the 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2022, which was held during April 2-7, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 46 full papers and 4 short papers presented in this volume were carefully reviewed and selected from 159 submissions. The proceedings also contain 16 tool papers of the affiliated competition SV-Comp and 1 paper consisting of the competition report.TACAS is a forum for researchers, developers, and users interested in rigorously based tools and algorithms for the construction and analysis of systems. The conference aims to bridge the gaps between different communities with this common interest and to support them in their quest to improve the utility, reliability, exibility, and efficiency of tools and algorithms for building computer-controlled systems.
R 1,471.50
Introduction To The Analysis Of Algorithms, An
This textbook covers the mathematical foundations of the analysis of algorithms. The gist of the book is how to argue, without the burden of excessive formalism, that a given algorithm does what it is supposed to do. The two key ideas of the proof of correctness, induction and invariance, are employed in the framework of pre/post-conditions and loop invariants.The algorithms considered are the basic and traditional algorithms of computer science, such as Greedy, Dynamic and Divide & Conquer. In addition, two classes of algorithms that rarely make it into introductory textbooks are discussed. Randomized algorithms, which are now ubiquitous because of their applications to cryptography; and Online algorithms, which are essential in fields as diverse as operating systems (caching, in particular) and stock-market predictions.This self-contained book is intended for undergraduate students in computer science and mathematics.
R 1,461.93
Algorithmic Aspects in Information and Management
This book constitutes the proceedings of the 15th International Conference on Algorithmic Aspects in Information and Management, AAIM 2021, which was held online during December 20-22, 2021. The conference was originally planned to take place in Dallas, Texas, USA, but changed to a virtual event due to the COVID-19 pandemic. The 38 regular papers included in this book were carefully reviewed and selected from 62 submissions. They were organized in the following topical sections: approximation algorithms; scheduling; nonlinear combinatorial optimization; network problems; blockchain, logic, complexity and reliability; and miscellaneous.
R 3,536.10
GIS Algorithms
Geographic information systems (GIS) have become increasingly important in helping us understand complex social, economic, and natural dynamics where spatial components play a key role. The critical algorithms used in GIS, however, are notoriously difficult to both teach and understand, in part due to the lack of a coherent representation. GIS Algorithms attempts to address this problem by combining rigorous formal language with example case studies and student exercises.Using Python code throughout, Xiao breaks the subject down into three fundamental areas:Geometric AlgorithmsSpatial IndexingSpatial Analysis and ModellingWith its comprehensive coverage of the many algorithms involved, GIS Algorithms is a key new textbook in this complex and critical area of geography.
R 3,874.74
Theory of Algorithms
Approach your problems from the right end It isn't that they can't see the solution. It is and begin with the answers. Then one day, that they can't see the problem. perhaps you will tind the tinal question. G. K. Chesterton. The Scandal of Father Brown 'The point of a Pin'. 'The Hermit CIad in Crane Feathers' in R. van Gulik's The Chinese Maze Murders. Growing specialization and diversification have brought a host of monographs and textbooks on increasingly specialized topics. However, the "tree" of knowledge of mathematics and related fields does not grow only by putting forth new branches. It also happens, quite of ten in fact, that branches which were thought to be completely disparate are suddenly seen to be related. Further, the kind and level of sophistication of mathematics applied in various sciences has changed drastically in recent years: measure theory is used (non-trivially) in regional and theoretical economics; algebraic geometry interacts with physics; the Minkowsky lemma, coding theory and the structure of water meet one another in packing and covering theory; quantum fields, crystal defects and mathematical programming profit from homotopy theory; Lie algebras are relevant to fiItering; and prediction and electrical engineering can use Stein spaces. And in addition to this there are such new emerging subdisciplines as "experimental mathematics", "CFD", "completely integrable systems", "chaos, synergetics and large-scale order", which are almost impossible to fit into the existing classification schemes. They draw upon widely different sections of mathematics.
R 4,400.34
Parallel Algorithms in Computational Science and Engineering
This contributed volume highlights two areas of fundamental interest in high-performance computing: core algorithms for important kernels and computationally demanding applications. The first few chapters explore algorithms, numerical techniques, and their parallel formulations for a variety of kernels that arise in applications. The rest of the volume focuses on state-of-the-art applications from diverse domains. By structuring the volume around these two areas, it presents a comprehensive view of the application landscape for high-performance computing, while also enabling readers to develop new applications using the kernels. Readers will learn how to choose the most suitable parallel algorithms for any given application, ensuring that theory and practicality are clearly connected. Applications using these techniques are illustrated in detail, including:Computational materials science and engineeringComputational cardiovascular analysisMultiscale analysis of wind turbines and turbomachineryWeather forecastingMachine learning techniquesParallel Algorithms in Computational Science and Engineering will be an ideal reference for applied mathematicians, engineers, computer scientists, and other researchers who utilize high-performance computing in their work.
R 5,004.31
Algorithms and Architectures for Parallel Processing
This two volume set LNCS 8630 and 8631 constitutes the proceedings of the 14th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2014, held in Dalian, China, in August 2014. The 70 revised papers presented in the two volumes were selected from 285 submissions. The first volume comprises selected papers of the main conference and papers of the 1st International Workshop on Emerging Topics in Wireless and Mobile Computing, ETWMC 2014, the 5th International Workshop on Intelligent Communication Networks, IntelNet 2014, and the 5th International Workshop on Wireless Networks and Multimedia, WNM 2014. The second volume comprises selected papers of the main conference and papers of the Workshop on Computing, Communication and Control Technologies in Intelligent Transportation System, 3C in ITS 2014, and the Workshop on Security and Privacy in Computer and Network Systems, SPCNS 2014.
R 1,649.99
Advances in Algorithms, Languages, and Complexity
This book contains a collection of survey papers in the areas of algorithms, lan guages and complexity, the three areas in which Professor Ronald V. Book has made significant contributions. As a fonner student and a co-author who have been influenced by him directly, we would like to dedicate this book to Professor Ronald V. Book to honor and celebrate his sixtieth birthday. Professor Book initiated his brilliant academic career in 1958, graduating from Grinnell College with a Bachelor of Arts degree. He obtained a Master of Arts in Teaching degree in 1960 and a Master of Arts degree in 1964 both from Wesleyan University, and a Doctor of Philosophy degree from Harvard University in 1969, under the guidance of Professor Sheila A. Greibach. Professor Book's research in discrete mathematics and theoretical com puter science is reflected in more than 150 scientific publications. These works have made a strong impact on the development of several areas of theoretical computer science. A more detailed summary of his scientific research appears in this volume separately.
R 6,023.18
R 1,130.00
R 1,527.00
Algorithms and Computation
The papers in this volume were selected for presentation at the Ninth Annual International Symposium on Algorithms and Computation (ISAAC'98),heldonDecember14-16,1998inTaejon,Korea.P- viousmeetingswereheldinTokyo(1990),Taipei(1991),Nagoya (1992),HongKong(1993),Beijing(1994),Cairns(1995),Osaka (1996),andSingapore(1997). The symposium was jointly sponsored by Korea Advanced - stitute of Science and Technology (KAIST) and Korea Information Science Society (KISS) to commemorate its 25th anniversary in - operationwithMinistryofInformationandCommunication,Korea InformationSocietyDevelopmentInstitute,andKoreaScienceand Engineering Foundation. Inresponsetothecallforpapers,102extendedabstractswere submitted from 21 countries. Each submitted paper was reported on byatleastfourprogramcommitteemembers,withtheassistance ofreferees,asindicatedbytherefereelistfoundintheseproce- ings. There were many more acceptable papers than there was space availableinthesymposiumschedule,andtheprogramcommittee's task was extremely di?cult.The 47 papers selected for presentation hadatotalof105authors,residentasfollows:Japan24,Germany 17,UnitedStateofAmerica15,Taiwan10,HongKongandKorea 6each,Spain5,SwitzerlandandAustralia4each,Austria,Canada, andFrance3each,ItalyandNetherlands2each,andGreece1. We thank all program committee members and their referees fortheirexcellentwork,especiallygiventhedemandingtimec- straints; they gave the symposium its distinctive character. We thank all who submitted papers for consideration: they all contributed to the high quality of the symposium. Finally,wethankallthepeoplewhoworkedhardtoputinplace the logistical arrangements of the symposium - our colleagues and our graduate students. It is their hard work that made the sym- sium possible and enjoyable.
R 1,588.56
Algorithms and Architectures for Parallel Processing
The three volume set LNCS 13155, 13156, and 13157 constitutes the refereed proceedings of the 21st International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2021, which was held online during December 3-5, 2021. The total of 145 full papers included in these proceedings were carefully reviewed and selected from 403 submissions. They cover the many dimensions of parallel algorithms and architectures including fundamental theoretical approaches, practical experimental projects, and commercial components and systems. The papers were organized in topical sections as follows:Part I, LNCS 13155: Deep learning models and applications; software systems and efficient algorithms; edge computing and edge intelligence; service dependability and security algorithms; data science; Part II, LNCS 13156: Software systems and efficient algorithms; parallel and distributed algorithms and applications; data science; edge computing and edge intelligence; blockchain systems; deept learning models and applications; IoT; Part III, LNCS 13157: Blockchain systems; data science; distributed and network-based computing; edge computing and edge intelligence; service dependability and security algorithms; software systems and efficient algorithms.
R 4,730.43
R 492.00
Data Mining Algorithms
Data Mining Algorithms is a practical, technically-oriented guide to data mining algorithms that covers the most important algorithms for building classification, regression, and clustering models, as well as techniques used for attribute selection and transformation, model quality evaluation, and creating model ensembles. The author presents many of the important topics and methodologies widely used in data mining, whilst demonstrating the internal operation and usage of data mining algorithms using examples in R.
R 2,929.00
Wireless Algorithms, Systems, and Applications
The three-volume set constitutes the proceedings of the 17th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2022, which was held during November 24th-26th, 2022. The conference took place in Dalian, China.The 95 full and 62 short papers presented in these proceedings were carefully reviewed and selected from 265 submissions. The contributions in cyber-physical systems including intelligent transportation systems and smart healthcare systems; security and privacy; topology control and coverage; energy-efficient algorithms, systems and protocol design
R 4,336.43
Algorithms in Ambient Intelligence
The advent of the digital era, the Internet, and the development of fast com puting devices that can access mass storage servers at high communication bandwidths have brought within our reach the world of ambient intelligent systems. These systems provide users with information, communication, and entertainment at any desired place and time. Since its introduction in 1998, the vision of Ambient Intelligence has attracted much attention within the re search community. Especially, the need for intelligence generated by smart al gorithms, which run on digital platforms that are integrated into consumer elec tronics devices, has strengthened the interest in Computational Intelligence. This newly developing research field, which can be positioned at the inter section of computer science, discrete mathematics, and artificial intelligence, contains a large variety of interesting topics including machine learning, con tent management, vision, speech, data mining, content augmentation, profiling, contextual awareness, feature extraction, resource management, security, and privacy.
R 4,663.11
R 1,352.55
Machine Learning Algorithms for Signal and Image Processing
Machine Learning Algorithms for Signal and Image Processing Enables readers to understand the fundamental concepts of machine and deep learning techniques with interactive, real-life applications within signal and image processing Machine Learning Algorithms for Signal and Image Processing aids the reader in designing and developing real-world applications using advances in machine learning to aid and enhance speech signal processing, image processing, computer vision, biomedical signal processing, adaptive filtering, and text processing. It includes signal processing techniques applied for pre-processing, feature extraction, source separation, or data decompositions to achieve machine learning tasks. Written by well-qualified authors and contributed to by a team of experts within the field, the work covers a wide range of important topics, such as: Speech recognition, image reconstruction, object classification and detection, and text processing Healthcare monitoring, biomedical systems, and green energy How various machine and deep learning techniques can improve accuracy, precision rate recall rate, and processing time Real applications and examples, including smart sign language recognition, fake news detection in social media, structural damage prediction, and epileptic seizure detection Professionals within the field of signal and image processing seeking to adapt their work further will find immense value in this easy-to-understand yet extremely comprehensive reference work. It is also a worthy resource for students and researchers in related fields who are looking to thoroughly understand the historical and recent developments that have been made in the field.
R 5,210.00
Numerical Computations: Theory and Algorithms
The two-volume set LNCS 11973 and 11974 constitute revised selected papers from the Third International Conference on Numerical Computations: Theory and Algorithms, NUMTA 2019, held in Crotone, Italy, in June 2019. This volume, LNCS 11973, consists of 34 full and 18 short papers chosen among papers presented at special streams and sessions of the Conference. The papers in part I were organized following the topics of these special sessions: approximation: methods, algorithms, and applications; computational methods for data analysis; first order methods in optimization: theory and applications; high performance computing in modelling and simulation; numbers, algorithms, and applications; optimization and management of water supply.
R 1,612.65
Genetic Algorithms and Genetic Programming
Genetic Algorithms and Genetic Programming: Modern Concepts and Practical Applications discusses algorithmic developments in the context of genetic algorithms (GAs) and genetic programming (GP). It applies the algorithms to significant combinatorial optimization problems and describes structure identification using HeuristicLab as a platform for algorithm development.The book focuses on both theoretical and empirical aspects. The theoretical sections explore the important and characteristic properties of the basic GA as well as main characteristics of the selected algorithmic extensions developed by the authors. In the empirical parts of the text, the authors apply GAs to two combinatorial optimization problems: the traveling salesman and capacitated vehicle routing problems. To highlight the properties of the algorithmic measures in the field of GP, they analyze GP-based nonlinear structure identification applied to time series and classification problems. Written by core members of the HeuristicLab team, this book provides a better understanding of the basic workflow of GAs and GP, encouraging readers to establish new bionic, problem-independent theoretical concepts. By comparing the results of standard GA and GP implementation with several algorithmic extensions, it also shows how to substantially increase achievable solution quality.
R 12,338.00
Hypercube Algorithms
Fundamentals algorithms for SIMD and MIMD hypercubes are developed. These include algorithms for such problems as data broadcasting, data sum, prefix sum, shift, data circulation, data accumulation, sorting, random access reads and writes and data permutation. The fundamental algorithms are then used to obtain efficient hypercube algorithms for matrix multiplication, image processing problems such as convolution, template matching, hough transform, clustering and image processing transformation, and string editing. Most of the algorithms in this book are for hypercubes with the number of processors being a function of problems size. However, for image processing problems, the book also includes algorithms for and MIMD hypercube with a small number of processes. Experimental results on an NCUBE/77 MIMD hypercube are also presented. The book is suitable for use in a one-semester or one-quarter course on hypercube algorithms. For students with no prior exposure to parallel algorithms, it is recommended that one week will be spent on the material in chapter 1, about six weeks on chapter 2 and one week on chapter 3. The remainder of the term can be spent covering topics from the rest of the book.
R 1,635.10
Finite and Algorithmic Model Theory
Intended for researchers and graduate students in theoretical computer science and mathematical logic, this volume contains accessible surveys by leading researchers from areas of current work in logical aspects of computer science, where both finite and infinite model-theoretic methods play an important role. Notably, the articles in this collection emphasize points of contact and connections between finite and infinite model theory in computer science that may suggest new directions for interaction. Among the topics discussed are: algorithmic model theory, descriptive complexity theory, finite model theory, finite variable logic, model checking, model theory for restricted classes of finite structures, and spatial databases. The chapters all include extensive bibliographies facilitating deeper exploration of the literature and further research.
R 3,244.73
Wireless Algorithms, Systems, and Applications
This book constitutes the refereed proceedings of the 8th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2013, held in Zhangjiajie, China, in August 2013. The 25 revised full papers presented together with 18 invited papers were carefully reviewed and selected from 80 submissions. The papers cover the following topics: effective and efficient state-of-the-art algorithm design and analysis, reliable and secure system development and implementations, experimental study and testbed validation, and new application exploration in wireless networks.
R 2,214.15
Experimental Algorithms
This proceedings volume contains the invited papers and the contributed papers th accepted for presentation at the 9 International Symposium on Experimental Algorithms (SEA 2010), that was held at the Continental Terme Hotel, Ischia (Naples), Italy, during May 20-22, 2010. PrevioussymposiaoftheserieswereheldinRiga(2001),MonteVerita(2003), RiodeJaneiro(2004),Santorini(2005),Menorca(2006),Rome(2007),CapeCod (2008), and Dortmund (2009). Seventy-three papers were submitted by researchers from 19 countries. Each paper was reviewed by three experts among the Program Committee members and some trusted external referees. At least two reviewers were from the same or closely related discipline as the authors. The reviewers generally provided a high-quality assessment of the papers and often gave extensive comments to the authors for the possible improvement of the presentation. The submission and review process was supported by the ConfTool conference management software and we are thankful to Harald Weinreich for letting us use it. The Program Committee selected 40 regular papers for presentation at the conference.In addition to the 40 contributed papers, this volume includes two invitedpapersrelatedtocorrespondingkeynotetalks:GiuseppeF.Italiano(U- versity of Rome "Tor Vergata,"Italy)spoke on "ExperimentalStudy of Resilient Algorithms and Data Structures" and PanosM. Pardalos(University of Florida, USA) spoke on "Computational Challenges with Cliques, Quasi-Cliques and Clique Partitions in Graphs." Many people and organizations contributed to SEA 2010. We are parti- larlygrateful for the patronageand ?nancial support of the University of Naples "FedericoII"andtheDepartmentofMathematicsandApplications"R.Cacci- poli,"and for the ?nancial support of GNCS (Gruppo Nazionale per il Calcolo Scienti?co) - INdAM (Istituto Nazionale di Alta Matematica).
R 4,126.04
Multilevel Optimization: Algorithms and Applications
Researchers working with nonlinear programming often claim "the word is non linear" indicating that real applications require nonlinear modeling. The same is true for other areas such as multi-objective programming (there are always several goals in a real application), stochastic programming (all data is uncer tain and therefore stochastic models should be used), and so forth. In this spirit we claim: The word is multilevel. In many decision processes there is a hierarchy of decision makers, and decisions are made at different levels in this hierarchy. One way to handle such hierar chies is to focus on one level and include other levels' behaviors as assumptions. Multilevel programming is the research area that focuses on the whole hierar chy structure. In terms of modeling, the constraint domain associated with a multilevel programming problem is implicitly determined by a series of opti mization problems which must be solved in a predetermined sequence. If only two levels are considered, we have one leader (associated with the upper level) and one follower (associated with the lower level).
R 6,018.31
Algorithmic Aspects Of Domination In Graphs
The domination problem in graph theory is to find a minimum sized vertex subset in a graph such that every vertex not in this set is adjacent to at least one vertex in this set. The domination problem and its variations serve as good models for many real problems including location problems in operations research.This comprehensive volume introduces domination and its variations in graphs from an algorithmic point of view. It examines the structures of various graph classes, including trees, chordal graphs, strongly chordal graphs, interval graphs, comparability graphs, permutation graphs, distance-hereditary graphs and generalizations of these graphs. These structure properties provide concepts for designing the algorithms.This useful reference text benefits researchers, academics, and graduate students in theoretical computer science, combinatorics, and operations research.
R 3,963.12
R 690.98
Representations for Genetic and Evolutionary Algorithms
In the field of genetic and evolutionary algorithms (GEAs), a large amount of theory and empirical study has been focused on operators and test problems, while problem representation has often been taken as given. This book breaks with this tradition and provides a comprehensive overview on the influence of problem representations on GEA performance. The book summarizes existing knowledge regarding problem representations and describes how basic properties of representations, such as redundancy, scaling, or locality, influence the performance of GEAs and other heuristic optimization methods. Using the developed theory, representations can be analyzed and designed in a theory-guided matter. The theoretical concepts are used for solving integer optimization problems and network design problems more efficiently. The book is written in an easy-readable style and is intended for researchers, practitioners, and students who want to learn about representations. This second edition extends the analysis of the basic properties of representations and introduces a new chapter on the analysis of direct representations.
R 4,660.61
Algorithms and Complexity
This book constitutes the refereed conference proceedings of the 8th International Conference on Algorithms and Complexity, CIAC 2013, held in Barcelona, Spain, during May 22-24, 2013. The 31 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers present current research in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures.
R 2,189.76
Parallel Algorithms for Irregular Problems: State of the Art
Efficient parallel solutions have been found to many problems. Some of them can be obtained automatically from sequential programs, using compilers. However, there is a large class of problems - irregular problems - that lack efficient solutions. IRREGULAR 94 - a workshop and summer school organized in Geneva - addressed the problems associated with the derivation of efficient solutions to irregular problems. This book, which is based on the workshop, draws on the contributions of outstanding scientists to present the state of the art in irregular problems, covering aspects ranging from scientific computing, discrete optimization, and automatic extraction of parallelism. Audience: This first book on parallel algorithms for irregular problems is of interest to advanced graduate students and researchers in parallel computer science.
R 4,662.37
Foundations and Methods in Combinatorial and Statistical Data Analysis and Clustering
This book offers an original and broad exploration of the fundamental methods in Clustering and Combinatorial Data Analysis, presenting new formulations and ideas within this very active field. With extensive introductions, formal and mathematical developments and real case studies, this book provides readers with a deeper understanding of the mutual relationships between these methods, which are clearly expressed with respect to three facets: logical, combinatorial and statistical. Using relational mathematical representation, all types of data structures can be handled in precise and unified ways which the author highlights in three stages:Clustering a set of descriptive attributesClustering a set of objects or a set of object categories Establishing correspondence between these two dual clusterings Tools for interpreting the reasons of a given cluster or clustering are also included.Foundations and Methods in Combinatorial and Statistical Data Analysis and Clustering will be a valuable resource for students and researchers who are interested in the areas of Data Analysis, Clustering, Data Mining and Knowledge Discovery.
R 4,714.26
Beyond Databases, Architectures and Structures
This book constitutes the refereed proceedings of the 11th International Conference entitled Beyond Databases, Architectures and Structures, BDAS 2015, held in Ustroń, Poland, in May 2015.This book consists of 53 carefully revised selected papers that are assigned to 8 thematic groups: database architectures and performance; data integration, storage and data warehousing; ontologies and semantic web; artificial intelligence, data mining and knowledge discovery; image analysis and multimedia mining; spatial data analysis; database systems development; application of database systems.
R 1,609.73
