Search results for "Data Structures and Algorithms in Java"
Items we need to order for you
Tools and Algorithms for the Construction and Analysis of Systems
This open access two-volume set constitutes the proceedings of the 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2021, which was held during March 27 – April 1, 2021, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic. The total of 41 full papers presented in the proceedings was carefully reviewed and selected from 141 submissions. The volume also contains 7 tool papers; 6 Tool Demo papers, 9 SV-Comp Competition Papers.The papers are organized in topical sections as follows:Part I: Game Theory; SMT Verification; Probabilities; Timed Systems; Neural Networks; Analysis of Network Communication.Part II: Verification Techniques (not SMT); Case Studies; Proof Generation/Validation; Tool Papers; Tool Demo Papers; SV-Comp Tool Competition Papers.
R 2,013.35
Java 11 and 12 – New Features
Enhance your development skills with Java’s state-of-the-art features and projects to make your applications leaner and fasterKey FeaturesOvercome the challenges involved in migrating to new versions of JavaDiscover how Oracle has bridged the gap between Java and native codeMake the best use of new Java features and libraries in your applicationsBook DescriptionWith its new six-monthly release cadence, Java is moving forward faster. In addition to planned version releases, a lot of work is currently being undertaken on various Java projects at Oracle. In order to make best use of the new features in their applications and libraries, you must be well-versed with the most recent advancements.Java 11 and 12 – New Features will take you through the latest developments in Java, right from variable type inference and simplified multithreading through to performance improvements, which are covered in depth to help you make your applications more efficient. This book explains the relevance and applicability of Java's new features, and answers your questions on whether to invest in migrating to new Java versions and when to migrate. You'll also get to grips with platform features, such as AppCDS and new garbage collectors, to tune and optimize your application—from reduced launch time and latency to improved performance and throughput.By the end of this book, you will be equipped with a thorough understanding of the new features of Java 11, 12, and Project Amber, and possess the skills to apply them with a view to improving your application's performance.What you will learnStudy type interference and how to work with the var typeUnderstand Class-Data Sharing, its benefits, and limitationsDiscover platform options to reduce your application’s launch timeImprove application performance by switching garbage collectorsGet up to date with the new Java release cadenceDefine and assess decision criteria for migrating to a new version of JavaWho this book is forIf you’re an executive or solutions architect responsible for technology selection or Java migration decisions, this Java book is for you. You’ll also benefit from this book if you’re a computer science enthusiast curious to learn about the latest and upcoming Java features. This book will help you migrate your solutions from Java 8 or older to the latest Java release.
R 1,140.00
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
This book constitutes the refereed proceedings of the 17th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-17, held in Bangalore, India, in December 2007. Among the subjects addressed are block codes, including list-decoding algorithms; algebra and codes: rings, fields, algebraic geometry codes; algebra: rings and fields, polynomials, permutations, lattices; cryptography: cryptanalysis and complexity; computational algebra.
R 1,570.63
Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques
This volume contains the papers presented at the3rd International Wo- shoponRandomizationandApproximationTechniquesinComputer Science (RANDOM'99) and the 2nd International Workshop on - proximation Algorithms for Combinatorial Optimization Problems (APPROX'99), which took place concurrently at the University of California, Berkeley, from August 8-11, 1999. RANDOM'99 is concerned with appli- tions of randomness to computational and combinatorial problems, and is the third workshop in the series following Bologna (1997) and Barcelona (1998). APPROX'99 focuses on algorithmic and complexity issues surrounding the - velopment of e?cient approximate solutions to computationally hard problems, and is the second in the series after Aalborg (1998). The volume contains 24 contributed papers, selected by the two program committees from 44 submissions received in response to the call for papers, together with abstracts of invited lectures by Uri Feige (Weizmann Institute), Christos Papadimitriou (UC Berkeley), Madhu Sudan (MIT), and Avi Wigd- son (Hebrew University and IAS Princeton).We would like to thank all of the authors who submitted papers, our invited speakers, the external referees we consulted and the members of the program committees, who were: RANDOM'99 APPROX'99 Alistair Sinclair, UC Berkeley Dorit Hochbaum, UC Berkeley Noga Alon, Tel Aviv U. Sanjeev Arora, Princeton U. Jennifer Chayes, Microsoft Leslie Hall, Johns Hopkins U. Monika Henzinger, Compaq-SRC Samir Khuller, U. of Maryland Mark Jerrum, U. of Edinburgh Phil Klein, Brown U.
R 1,557.71
Tools and Algorithms for the Construction and Analysis of Systems
This open access two-volume set constitutes the proceedings of the 26th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2020, which took place in Dublin, Ireland, in April 2020, and was held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020.The total of 60 regular papers presented in these volumes was carefully reviewed and selected from 155 submissions. The papers are organized in topical sections as follows: Part I: Program verification; SAT and SMT; Timed and Dynamical Systems; Verifying Concurrent Systems; Probabilistic Systems; Model Checking and Reachability; and Timed and Probabilistic Systems.Part II: Bisimulation; Verification and Efficiency; Logic and Proof; Tools and Case Studies; Games and Automata; and SV-COMP 2020.
R 1,828.97
Algebraic Modeling of Topological and Computational Structures and Applications
This interdisciplinary book covers a wide range of subjects, from pure mathematics (knots, braids, homotopy theory, number theory) to more applied mathematics (cryptography, algebraic specification of algorithms, dynamical systems) and concrete applications (modeling of polymers and ionic liquids, video, music and medical imaging). The main mathematical focus throughout the book is on algebraic modeling with particular emphasis on braid groups.The research methods include algebraic modeling using topological structures, such as knots, 3-manifolds, classical homotopy groups, and braid groups. The applications address the simulation of polymer chains and ionic liquids, as well as the modeling of natural phenomena via topological surgery. The treatment of computational structures, including finite fields and cryptography, focuses on the development of novel techniques. These techniques can be applied to the design of algebraic specifications for systems modeling and verification. This book is the outcome of a workshop in connection with the research project Thales on Algebraic Modeling of Topological and Computational Structures and Applications, held at the National Technical University of Athens, Greece in July 2015. The reader will benefit from the innovative approaches to tackling difficult questions in topology, applications and interrelated research areas, which largely employ algebraic tools.
R 6,228.00
Algorithms for Sensor Systems
This book constitutes the thoroughly refereed post-conference proceedings of the 8th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2012, held in Ljubljana, Slovenia, in September 2012. The 11 revised full papers presented together with two invited keynote talks and two brief announcements were carefully reviewed and selected from 24 submissions. The papers are organized in two tracks: sensor networks - covering topics such as barrier resilience, localization, connectivity with directional antennas, broadcast scheduling, and data aggregation; and ad hoc wireless and mobile systems - covering topics such as: SINR model; geometric routing; cognitive radio networks; video delivery; and mapping polygons.
R 1,398.15
Combinatorial Algorithms
This book constitutes the refereed post-conference proceedings of the 30th International Workshop on Combinatorial Algorithms, IWOCA 2019, held in Pisa, Italy, in July 2019. The 36 regular papers presented in this volume were carefully reviewed and selected from 73 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, cryptography and information security, algorithms on strings and graphs, graph drawing and labelling, computational algebra and geometry, computational biology, probabilistic and randomized algorithms, algorithms for big data analytics, and new paradigms of computation.
R 3,156.67
Solving Irregularly Structured Problems in Parallel
This book constitutes the refereed proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel, IRREGULAR'97, held in Paderborn, Germany, in June 1997.The 18 revised full papers presented were carefully selected by the program committee for inclusion in the volume; also included are full papers by the five invited speakers. Among the topics covered are discrete algorithms, randomized methods and approximation algorithms, implementations, programming environments, systems and applications, and scheduling and load balancing.
R 1,557.71
Algorithms and Discrete Applied Mathematics
This book collects the refereed proceedings of the First International Conference onon Algorithms and Discrete Applied Mathematics, CALDAM 2015, held in Kanpur, India, in February 2015. The volume contains 26 full revised papers from 58 submissions along with 2 invited talks presented at the conference. The workshop covered a diverse range of topics on algorithms and discrete mathematics, including computational geometry, algorithms including approximation algorithms, graph theory and computational complexity.
R 2,176.09
Stochastic Recursive Algorithms for Optimization
Stochastic Recursive Algorithms for Optimization presents algorithms for constrained and unconstrained optimization and for reinforcement learning. Efficient perturbation approaches form a thread unifying all the algorithms considered. Simultaneous perturbation stochastic approximation and smooth fractional estimators for gradient- and Hessian-based methods are presented. These algorithms: • are easily implemented; • do not require an explicit system model; and • work with real or simulated data. Chapters on their application in service systems, vehicular traffic control and communications networks illustrate this point. The book is self-contained with necessary mathematical results placed in an appendix. The text provides easy-to-use, off-the-shelf algorithms that are given detailed mathematical treatment so the material presented will be of significant interest to practitioners, academic researchers and graduate students alike. The breadth of applications makes the book appropriate for reader from similarly diverse backgrounds: workers in relevant areas of computer science, control engineering, management science, applied mathematics, industrial engineering and operations research will find the content of value.
R 4,276.03
Graphs and Algorithms in Communication Networks
Algorithmic discrete mathematics plays a key role in the development of information and communication technologies, and methods that arise in computer science, mathematics and operations research – in particular in algorithms, computational complexity, distributed computing and optimization – are vital to modern services such as mobile telephony, online banking and VoIP.This book examines communication networking from a mathematical viewpoint. The contributing authors took part in the European COST action 293 – a four-year program of multidisciplinary research on this subject. In this book they offer introductory overviews and state-of-the-art assessments of current and future research in the fields of broadband, optical, wireless and ad hoc networks. Particular topics of interest are design, optimization, robustness and energy consumption.The book will be of interest to graduate students, researchers and practitioners in the areas of networking, theoretical computer science, operations research, distributed computing and mathematics.
R 5,645.01
Algorithms for Convex Optimization
In the last few years, Algorithms for Convex Optimization have revolutionized algorithm design, both for discrete and continuous optimization problems. For problems like maximum flow, maximum matching, and submodular function minimization, the fastest algorithms involve essential methods such as gradient descent, mirror descent, interior point methods, and ellipsoid methods. The goal of this self-contained book is to enable researchers and professionals in computer science, data science, and machine learning to gain an in-depth understanding of these algorithms. The text emphasizes how to derive key algorithms for convex optimization from first principles and how to establish precise running time bounds. This modern text explains the success of these algorithms in problems of discrete optimization, as well as how these methods have significantly pushed the state of the art of convex optimization itself.
R 1,805.59
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
The refereed post-proceedings of the First International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies are presented in this volume. The symposium provided an interdisciplinary forum for researchers to share their discoveries and approaches. The 46 full papers address large data processing problems using different methodologies from major disciplines such as computer science, combinatorics, and statistics.
R 1,596.48
Complementarity: Applications, Algorithms and Extensions
This volume presents state-of-the-art complementarity applications, algorithms, extensions and theory in the form of eighteen papers. These at the International Conference on Com invited papers were presented plementarity 99 (ICCP99) held in Madison, Wisconsin during June 9-12, 1999 with support from the National Science Foundation under Grant DMS-9970102. Complementarity is becoming more widely used in a variety of appli cation areas. In this volume, there are papers studying the impact of complementarity in such diverse fields as deregulation of electricity mar kets, engineering mechanics, optimal control and asset pricing. Further more, application of complementarity and optimization ideas to related problems in the burgeoning fields of machine learning and data mining are also covered in a series of three articles. In order to effectively process the complementarity problems that arise in such applications, various algorithmic, theoretical and computational extensions are covered in this volume. Nonsmooth analysis has an im portant role to play in this area as can be seen from articles using these tools to develop Newton and path following methods for constrained nonlinear systems and complementarity problems. Convergence issues are covered in the context of active set methods, global algorithms for pseudomonotone variational inequalities, successive convex relaxation and proximal point algorithms. Theoretical contributions to the connectedness of solution sets and constraint qualifications in the growing area of mathematical programs with equilibrium constraints are also presented. A relaxation approach is given for solving such problems. Finally, computational issues related to preprocessing mixed complementarity problems are addressed.
R 4,672.07
Heuristic Approach to Possibilistic Clustering: Algorithms and Applications
The present book outlines a new approach to possibilistic clustering in which the sought clustering structure of the set of objects is based directly on the formal definition of fuzzy cluster and the possibilistic memberships are determined directly from the values of the pairwise similarity of objects. The proposed approach can be used for solving different classification problems. Here, some techniques that might be useful at this purpose are outlined, including a methodology for constructing a set of labeled objects for a semi-supervised clustering algorithm, a methodology for reducing analyzed attribute space dimensionality and a methods for asymmetric data processing. Moreover, a technique for constructing a subset of the most appropriate alternatives for a set of weak fuzzy preference relations, which are defined on a universe of alternatives, is described in detail, and a method for rapidly prototyping the Mamdani’s fuzzy inference systems is introduced. This book addresses engineers, scientists, professors, students and post-graduate students, who are interested in and work with fuzzy clustering and its applications
R 3,027.31
Distributed Algorithms for Message-Passing Systems
Distributed computing is at the heart of many applications. It arises as soon as one has to solve a problem in terms of entities -- such as processes, peers, processors, nodes, or agents -- that individually have only a partial knowledge of the many input parameters associated with the problem. In particular each entity cooperating towards the common goal cannot have an instantaneous knowledge of the current state of the other entities. Whereas parallel computing is mainly concerned with 'efficiency', and real-time computing is mainly concerned with 'on-time computing', distributed computing is mainly concerned with 'mastering uncertainty' created by issues such as the multiplicity of control flows, asynchronous communication, unstable behaviors, mobility, and dynamicity. While some distributed algorithms consist of a few lines only, their behavior can be difficult to understand and their properties hard to state and prove. The aim of this book is to present in a comprehensive way the basic notions, concepts, and algorithms of distributed computing when the distributed entities cooperate by sending and receiving messages on top of an asynchronous network. The book is composed of seventeen chapters structured into six parts: distributed graph algorithms, in particular what makes them different from sequential or parallel algorithms; logical time and global states, the core of the book; mutual exclusion and resource allocation; high-level communication abstractions; distributed detection of properties; and distributed shared memory. The author establishes clear objectives per chapter and the content is supported throughout with illustrative examples, summaries, exercises, and annotated bibliographies. This book constitutes an introduction to distributed computing and is suitable for advanced undergraduate students or graduate students in computer science and computer engineering, graduate students in mathematics interested in distributed computing, and practitioners and engineers involved in the design and implementation of distributed applications. The reader should have a basic knowledge of algorithms and operating systems.
R 2,564.00
Algorithms -- ESA 2004
This volume contains the 70 contributed papers and abstracts of two invited l- tures presented at the 12th Annual European Symposium on Algorithms (ESA 2004), held in Bergen, Norway, September 14-17, 2004. The papers in each s- tion of the proceedings are arranged alphabetically. The three distinguished - vited speakers were David Eppstein, Michael Fellows and Monika Henzinger. As in the last two years, ESA had two tracks, with separate program c- mittees, which dealt respectively with: - the design and mathematical analysis of algorithms (the "Design and A- lysis" track); - real-world applications, engineering and experimental analysis of algorithms (the "Engineering and Applications" track). Previous ESAs were held at Bad Honnef, Germany (1993); Utrecht, The Netherlands (1994); Corfu, Greece (1995); Barcelona, Spain (1996); Graz, A- tria (1997); Venice, Italy (1998); Prague, Czech Republic (1999); Saarbruc .. ken, ? Germany (2000); Arhus, Denmark (2001); Rome, Italy (2002); and Budapest, Hungary (2003). The predecessor to the Engineering and Applications track of ESA was the annual Workshop on Algorithm Engineering (WAE).Previous WAEs were held in Venice, Italy (1997); Saarbruc .. ken, Germany (1998); London, ? UK (1999); Saarbruc .. ken, Germany (2000); and Arhus, Denmark (2001). The proceedings of the previous ESAs were published as Springer-Verlag's LNCS volumes 726, 855, 979, 1284, 1461, 1643, 1879, 2161, 2461, and 2832. The proceedingsoftheWAEsfrom1999onwardswerepublishedasSpringer-Verlag's LNCS volumes 1668, 1982, and 2141.
R 3,128.43
Theory and Practice of Algorithms in (Computer) Systems
This book constitutes the refereed proceedings of the First International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS 2011, held in Rome, Italy, in April 2011. The 25 papers presented, including three short papers by invited speakers, were carefully reviewed and selected from 45 submissions. The papers all feature original research in the design, implementation and evaluation of algorithms with special focus on algorithms for combinatorial optimization problems, and to real-world applications, engineering and experimental analysis of algorithms - thus fostering the cooperation among researchers in computer science, networking, discrete mathematics, mathematical programming and operations research.
R 2,169.62
Numerical Algorithms for Personalized Search in Self-organizing Information Networks
This book lays out the theoretical groundwork for personalized search and reputation management, both on the Web and in peer-to-peer and social networks. Representing much of the foundational research in this field, the book develops scalable algorithms that exploit the graphlike properties underlying personalized search and reputation management, and delves into realistic scenarios regarding Web-scale data. Sep Kamvar focuses on eigenvector-based techniques in Web search, introducing a personalized variant of Google's PageRank algorithm, and he outlines algorithms--such as the now-famous quadratic extrapolation technique--that speed up computation, making personalized PageRank feasible. Kamvar suggests that Power Method-related techniques ultimately should be the basis for improving the PageRank algorithm, and he presents algorithms that exploit the convergence behavior of individual components of the PageRank vector. Kamvar then extends the ideas of reputation management and personalized search to distributed networks like peer-to-peer and social networks.He highlights locality and computational considerations related to the structure of the network, and considers such unique issues as malicious peers. He describes the EigenTrust algorithm and applies various PageRank concepts to P2P settings. Discussion chapters summarizing results conclude the book's two main sections. Clear and thorough, this book provides an authoritative look at central innovations in search for all of those interested in the subject.
R 2,672.85
Analysis and Computation of Microstructure in Finite Plasticity
This book addresses the need for a fundamental understanding of the physical origin, the mathematical behavior and the numerical treatment of models which include microstructure. Leading scientists present their efforts involving mathematical analysis, numerical analysis, computational mechanics, material modelling and experiment. The mathematical analyses are based on methods from the calculus of variations, while in the numerical implementation global optimization algorithms play a central role. The modeling covers all length scales, from the atomic structure up to macroscopic samples. The development of the models ware guided by experiments on single and polycrystals and results will be checked against experimental data.
R 4,267.05
Automatic Design of Decision-Tree Induction Algorithms
Presents a detailed study of the major design components that constitute a top-down decision-tree induction algorithm, including aspects such as split criteria, stopping criteria, pruning and the approaches for dealing with missing values. Whereas the strategy still employed nowadays is to use a 'generic' decision-tree induction algorithm regardless of the data, the authors argue on the benefits that a bias-fitting strategy could bring to decision-tree induction, in which the ultimate goal is the automatic generation of a decision-tree induction algorithm tailored to the application domain of interest. For such, they discuss how one can effectively discover the most suitable set of components of decision-tree induction algorithms to deal with a wide variety of applications through the paradigm of evolutionary computation, following the emergence of a novel field called hyper-heuristics."Automatic Design of Decision-Tree Induction Algorithms" would be highly useful for machine learning and evolutionary computation students and researchers alike.
R 2,346.62
Data Mining Algorithms in C++
Discover hidden relationships among the variables in your data, and learn how to exploit these relationships. This book presents a collection of data-mining algorithms that are effective in a wide variety of prediction and classification applications. All algorithms include an intuitive explanation of operation, essential equations, references to more rigorous theory, and commented C++ source code.Many of these techniques are recent developments, still not in widespread use. Others are standard algorithms given a fresh look. In every case, the focus is on practical applicability, with all code written in such a way that it can easily be included into any program. The Windows-based DATAMINE program lets you experiment with the techniques before incorporating them into your own work.What You'll LearnUse Monte-Carlo permutation tests to provide statistically sound assessments of relationships present in your dataDiscover how combinatorially symmetric cross validation reveals whether your model has true power or has just learned noise by overfitting the dataWork with feature weighting as regularized energy-based learning to rank variables according to their predictive power when there is too little data for traditional methodsSee how the eigenstructure of a dataset enables clustering of variables into groups that exist only within meaningful subspaces of the dataPlot regions of the variable space where there is disagreement between marginal and actual densities, or where contribution to mutual information is highWho This Book Is ForAnyone interested in discovering and exploiting relationships among variables. Although all code examples are written in C++, the algorithms are described in sufficient detail that they can easily be programmed in any language.
R 1,980.80
R 1,665.00
New Frontier In Evolutionary Algorithms: Theory And Applications
This book delivers theoretical and practical knowledge of Genetic Algorithms (GA) for the purpose of practical applications. It provides a methodology for a GA-based search strategy with the integration of several Artificial Life and Artificial Intelligence techniques, such as memetic concepts, swarm intelligence, and foraging strategies. The development of such tools contributes to better optimizing methodologies when addressing tasks from areas such as robotics, financial forecasting, and data mining in bioinformatics.The emphasis of this book is on applicability to the real world. Tasks from application areas - optimization of the trading rule in foreign exchange (FX) and stock prices, economic load dispatch in power system, exit/door placement for evacuation planning, and gene regulatory network inference in bioinformatics - are studied, and the resultant empirical investigations demonstrate how successful the proposed approaches are when solving real-world tasks of great importance.
R 2,367.05
Algorithm-Architecture Matching for Signal and Image Processing
Advances in signal and image processing together with increasing computing power are bringing mobile technology closer to applications in a variety of domains like automotive, health, telecommunication, multimedia, entertainment and many others. The development of these leading applications, involving a large diversity of algorithms (e.g. signal, image, video, 3D, communication, cryptography) is classically divided into three consecutive steps: a theoretical study of the algorithms, a study of the target architecture, and finally the implementation. Such a linear design flow is reaching its limits due to intense pressure on design cycle and strict performance constraints. The approach, called Algorithm-Architecture Matching, aims to leverage design flows with a simultaneous study of both algorithmic and architectural issues, taking into account multiple design constraints, as well as algorithm and architecture optimizations, that couldn’t be achieved otherwise if considered separately. Introducing new design methodologies is mandatory when facing the new emerging applications as for example advanced mobile communication or graphics using sub-micron manufacturing technologies or 3D-Integrated Circuits. This diversity forms a driving force for the future evolutions of embedded system designs methodologies.The main expectations from system designers’ point of view are related to methods, tools and architectures supporting application complexity and design cycle reduction. Advanced optimizations are essential to meet design constraints and to enable a wide acceptance of these new technologies.Algorithm-Architecture Matching for Signal and Image Processing presents a collection of selected contributions from both industry and academia, addressing different aspects of Algorithm-Architecture Matching approach ranging from sensors to architectures design. The scope of this book reflects the diversity of potential algorithms, including signal, communication, image, video, 3D-Graphics implemented onto various architectures from FPGA to multiprocessor systems. Several synthesis and resource management techniques leveraging design optimizations are also described and applied to numerous algorithms.Algorithm-Architecture Matching for Signal and Image Processing should be on each designer’s and EDA tool developer’s shelf, as well as on those with an interest in digital system design optimizations dealing with advanced algorithms.
R 4,655.92
Graphs and Algorithms in Communication Networks
Algorithmic discrete mathematics plays a key role in the development of information and communication technologies, and methods that arise in computer science, mathematics and operations research – in particular in algorithms, computational complexity, distributed computing and optimization – are vital to modern services such as mobile telephony, online banking and VoIP.This book examines communication networking from a mathematical viewpoint. The contributing authors took part in the European COST action 293 – a four-year program of multidisciplinary research on this subject. In this book they offer introductory overviews and state-of-the-art assessments of current and future research in the fields of broadband, optical, wireless and ad hoc networks. Particular topics of interest are design, optimization, robustness and energy consumption.The book will be of interest to graduate students, researchers and practitioners in the areas of networking, theoretical computer science, operations research, distributed computing and mathematics.
R 6,945.59
Emergence, Analysis and Evolution of Structures
In May 2002 a number of about 20 scientists from various disciplines were invited by the Berlin-Brandenburg Academy of Sciences and Humanities to participate in an interdisciplinary workshop on structures and structure generating processes. The site was the beautiful little castle of Blankensee, south of Berlin. The disciplines represented ranged from mathematics and information theory, over various ?elds of engineering, biochemistry and biology, to the economic and social sciences. All participants presented talks explaining the nature of structures considered in their ?elds and the associated procedures of analysis. It soon became evident that the study of structures is indeed a common c- cern of virtually all disciplines. The motivation as well as the methods of analysis, however, differ considerably. In engineering, the generation of artifacts, such as infrastructures or technological processes, are of primary interest. Frequently, the analysis aims there at de?ning a simpli?ed mathematical model for the optimization of the structures and the structure generating processes. Mathematical or heuristic methods are applied, the latter preferably of the type of biology based evolutionary algorithms. On the other hand, setting up complex technical structures is not pos- ble by such simpli?ed model calculations but requires a different and less model but rather knowledge-based type of approach, using empirical rules rather than formal equations. In biochemistry, interest is frequently focussed on the structures of molecules, such as proteins or ribonucleic acids. Again, optimal structures can usually be de?ned.
R 5,343.92
Wireless Algorithms, Systems, and Applications
This book constitutes the refereed proceedings of the 4th Annual International Conference on Wireless Algorithms, Systems, and Applications, WASA 2009, held in Boston, MA, USA, in August 2009. The 36 revised full papers presented together with 15 invited papers and 7 workshop papers were carefully reviewed and selected from numerous submissions. Providing a forum for researchers and practitioners worldwide, the papers address current research and development efforts of various issues in the area of algorithms, systems and applications for current and next generation infrastructure and wireless networks. They are divided in topical sections on applications, experimentation, power management; coverage, detection, and topology control; routing, querying, and data collection; localization, security, and services; scheduling and resource management; and online social networks, applications, and systems.
R 3,088.15
Combinatorial Heuristic Algorithms with FORTRAN
In recent years researchers have spent much effort in developing efficient heuristic algorithms for solving the class of NP-complete problems which are widely believed to be inherently intractable from the computational point of view. Although algorithms have been designed and are notorious among researchers, computer programs are either not implemented on computers or very difficult to obtain. The purpose of this book is to provide a source of FORTRAN coded algorithms for a selected number of well-known combinatorial optimization problems. The book is intended to be used as a supplementary text in combinatorial algorithms, network optimization, operations research and management science. In addition, a short description on each algorithm will allow the book to be used as a convenient reference. This work would not have been possible without the excellent facilities of Bell-Northern Research, Canada. H. T. Lau lIe des Soeurs Quebec, Canada August 1986 CONTENTS Page Introduction Part I. INTEGER PROGRAMMING Chapter 1. Integer Linear Programming Chapter 2. Zero-one Linear Programming 30 Chapter 3. Zero-one Knapsack Problem 38 Part II. NETWORK DESIGN Chapter 4. Traveling Salesman Problem 52 Chapter 5. Steiner Tree Problem 81 Chapter 6. Graph Partitioning 98 Chapter 7. K-Median Location 106 Chapter 8. K-Center Location 114 List of Subroutines 123 Bibliographic Notes 124 INTRODUCTION Following the elegant theory of NP-comp1eteness, the idea of developing efficient heuristic algorithms has been gaining its popularity and significance.
R 2,015.00
Experimental and Efficient Algorithms
This book constitutes the refereed proceedings of the Second International Workshop on Experimental and Efficient Algorithms, WEA 2003, held in Ascona, Switzerland in May 2003.The 19 revised full papers presented together with 3 invited contributions were carefully reviewed and selected from 40 submissions. The focus of the volume is on applications of efficient algorithms for combinatorial problems.
R 2,015.00
VLSI Algorithms and Architectures
From the Foreword: "The papers in this volume were presented at the Aegean Workshop on Computing: VLSI Algorithms and Architectures (AWOC 88), organized by the Computer Technology Institute in Patras in cooperation with ACM, EATCS, IEEE and the General Secretariat of Research and Technology (Ministry of Industry, Energy & technology of Greece). They were selected from 119 abstracts submitted in response to the program committee's call for papers and to additional invitations from John Reif. AWOC 88 took place in Corfu, Greece, June 28-July 1, 1988. AWOC 88 is the third meeting in the International Workshop on Parallel Computing & VLSI series; the first meeting took place in Amalfi, Italy, 1984, and the second at Loutraki, Greece, 1986."
R 3,068.76
Algorithms, Concurrency and Knowledge
This volume constitutes the refereed proceedings of the 1995 Asian Computing Science Conference, ACSC 95, held in Pathumthani, Thailand in December 1995.The 29 fully revised papers presented were selected from a total of 102 submissions; clearly the majority of the participating researchers come from South-East Asian countries, but there is also a strong international component. The volume reflects research activities, particularly by Asian computer science researchers, in different areas. Special attention is paid to algorithms, knowledge representation, programming and specification languages, verification, concurrency, networking and distributed systems, and databases.
R 1,577.08
Tools and Algorithms for the Construction and Analysis of Systems
This open access two-volume set constitutes the proceedings of the 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2021, which was held during March 27 – April 1, 2021, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic.The total of 41 full papers presented in the proceedings was carefully reviewed and selected from 141 submissions. The volume also contains 7 tool papers; 6 Tool Demo papers, 9 SV-Comp Competition Papers.The papers are organized in topical sections as follows:Part I: Game Theory; SMT Verification; Probabilities; Timed Systems; Neural Networks; Analysis of Network Communication.Part II: Verification Techniques (not SMT); Case Studies; Proof Generation/Validation; Tool Papers; Tool Demo Papers; SV-Comp Tool Competition Papers.
R 2,014.38
Artificial Intelligence Algorithms and Applications
This book constitutes the thoroughly refereed proceedings of the 11th International Symposium on Intelligence Computation and Applications, ISICA 2019, held in Guangzhou, China, in November 2019.The 65 papers presented were carefully reviewed and selected from the total of 112 submissions. This volume features the most up-to-date research in evolutionary algorithms, parallel computing and quantum computing, evolutionary multi-objective and dynamic optimization, intelligent multimedia systems, virtualization and AI applications, smart scheduling, intelligent control, big data and cloud computing, deep learning, and hybrid machine learning systems.The papers are organized according to the following topical sections: new frontier in evolutionary algorithms; evolutionary multi-objective and dynamic optimization; intelligent multimedia systems; virtualization and AI applications; smart scheduling; intelligent control; big data and cloud computing; statistical learning.
R 3,123.43
Approximation and Online Algorithms
This book constitutes the thoroughly refereed workshop post-proceedings of the 15th International Workshop on Approximation and Online Algorithms, WAOA 2017, held in Vienna, Austria, in September 2017 as part of ALGO 2017.The 23 revised full papers presented in this book were carefully reviewed and selected from 50 submissions. Topics of interest for WAOA 2017 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.
R 2,180.06
Recent Developments in Structure-Preserving Algorithms for Oscillatory Differential Equations
The main theme of this book is recent progress in structure-preserving algorithms for solving initial value problems of oscillatory differential equations arising in a variety of research areas, such as astronomy, theoretical physics, electronics, quantum mechanics and engineering. It systematically describes the latest advances in the development of structure-preserving integrators for oscillatory differential equations, such as structure-preserving exponential integrators, functionally fitted energy-preserving integrators, exponential Fourier collocation methods, trigonometric collocation methods, and symmetric and arbitrarily high-order time-stepping methods. Most of the material presented here is drawn from the recent literature. Theoretical analysis of the newly developed schemes shows their advantages in the context of structure preservation. All the new methods introduced in this book are proven to be highly effective compared with the well-known codes in the scientific literature. This book also addresses challenging problems at the forefront of modern numerical analysis and presents a wide range of modern tools and techniques.
R 4,331.08
R 608.00
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,456.36
Tools and Algorithms for the Construction and Analysis of Systems
This book is Open Access under a CC BY licence.The LNCS 10805 and 10806 proceedings set constitutes the proceedings of the 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2018, which took place in Thessaloniki, Greece, in April 2018, held as part of the European Joint Conference on Theory and Practice of Software, ETAPS 2018.The total of 43 full and 11 short papers presented in these volumes was carefully reviewed and selected from 154submissions. The papers are organized in topical sections as follows:Part I: theorem proving; SAT and SMT I; deductive verification; software verification and optimization; model checking; and machine learning. Part II: concurrent and distributed systems; SAT and SMT II; security and reactive systems; static and dynamic program analysis; hybrid and stochastic systems; temporal logic and mu-calculus; 7th Competition on Software Verification – SV-COMP.
R 2,394.99
Foundations of Software Science and Computational Structures
The present volume contains the proceedings of the international conference Foundations of Software Science and Computation Structures(FOSSACS)2003, held in Warsaw, Poland, April 7-9, 2003. FOSSACS is an event of the Joint European Conferences on Theory and Practice of Software (ETAPS). The pre- ous ?ve FOSSACS conferences took place in Lisbon (1998), Amsterdam (1999), Berlin (2000), Genoa (2001), and Grenoble (2002). FOSSACS presents original papers on foundational researchwith a clear s- ni?cancetosoftwarescience.TheProgramCommitteeinvitedpapersontheories and methodsto supportthe analysis,integration,synthesis,transformation,and veri?cation of programs and software systems. We identi?ed the following t- ics, in particular: algebraic models; automata and language theory; behavioural equivalences; categorical models; computation processes over discrete and c- tinuous data; computation structures; logics of programs; modal, spatial, and temporallogics;modelsof concurrent,reactive,distributed, and mobile systems; processalgebrasandcalculi;semanticsofprogramminglanguages;softwaresp- i?cation and re?nement; transition systems; and type systems and type theory.We received 96 submissions, of which 2 were withdrawn. This proceedings consists of 27 papers. The ?rst-A Game Semantics for Generic Polymorphism-accompanies the invited lecture by Samson Abramsky, University of Oxford. The remaining 26 were selected for publication by the Program Committee during a week-long electronic discussion. I sincerely thank all the authors of papers submitted to FOSSACS 2003; the number and the quality of papers were exceptionally high this year. Moreover, I would like to thank all the members of the ProgramCommittee for the excellent job they did during a rather demanding selection process, and to thank all our subreferees for their invaluable contributions to this process.
R 1,582.10
Anomaly Detection Principles and Algorithms
This book provides a readable and elegant presentation of the principles of anomaly detection,providing an easy introduction for newcomers to the field. A large number of algorithms are succinctly described, along with a presentation of their strengths and weaknesses.The authors also cover algorithms that address different kinds of problems of interest with single and multiple time series data and multi-dimensional data. New ensemble anomaly detection algorithms are described, utilizing the benefits provided by diverse algorithms, each of which work well on some kinds of data. With advancements in technology and the extensive use of the internet as a medium for communications and commerce, there has been a tremendous increase in the threats faced by individuals and organizations from attackers and criminal entities. Variations in the observable behaviors of individuals (from others and from their own past behaviors) have been found to be useful in predicting potential problems of various kinds. Hence computer scientists and statisticians have been conducting research on automatically identifying anomalies in large datasets. This book will primarily target practitioners and researchers who are newcomers to the area of modern anomaly detection techniques. Advanced-level students in computer science will also find this book helpful with their studies.
R 3,540.07
Novel Research and Development Approaches in Heterogeneous Systems and Algorithms
Almost every element of life, from commerce and agriculture to communication and entertainment, has been profoundly altered by computing. Around the world, people rely on computers for the creation of systems for energy, transportation, and military use. Additionally, computing fosters scientific advancements that advance our basic understanding of the world and assist in finding answers to pressing health and environmental issues. Novel Research and Development Approaches in Heterogeneous Systems and Algorithms addresses novel research and developmental approaches in heterogenous systems and algorithms for information-centric networks of the future. Covering topics such as image identification and segmentation, materials data extraction, and wireless sensor networks, this premier reference source is a valuable resource for engineers, consultants, practitioners, computer scientists, students and educators of higher education, librarians, researchers, and academicians.
R 10,426.94
Genetic Algorithms and Applications for Stock Trading Optimization
Genetic algorithms (GAs) are based on Darwin's theory of natural selection and survival of the fittest. They are designed to competently look for solutions to big and multifaceted problems. Genetic algorithms are wide groups of interrelated events with divided steps. Each step has dissimilarities, which leads to a broad range of connected actions. Genetic algorithms are used to improve trading systems, such as to optimize a trading rule or parameters of a predefined multiple indicator market trading system. Genetic Algorithms and Applications for Stock Trading Optimization is a complete reference source to genetic algorithms that explains how they might be used to find trading strategies, as well as their use in search and optimization. It covers the functions of genetic algorithms internally, computer implementation of pseudo-code of genetic algorithms in C++, technical analysis for stock market forecasting, and research outcomes that apply in the stock trading system. This book is ideal for computer scientists, IT specialists, data scientists, managers, executives, professionals, academicians, researchers, graduate-level programs, research programs, and post-graduate students of engineering and science.
R 7,340.11
R 2,317.00
