Search results for "Data Structures and Algorithms in Java"
Items we need to order for you
Algorithms and Models for the Web-Graph
This volume contains the 14 contributed papers and the contribution of the distinguished invited speaker B´ ela Bollob´ as presented at the 3rd Workshop on Algorithms and Models for the Web-Graph (WAW 2004), held in Rome, Italy, October 16, 2004, in conjunction with the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2004). The World Wide Web has become part of our everyday life and information retrievalanddataminingontheWebisnowofenormouspracticalinterest.Some of the algorithms supporting these activities are based substantially on viewing the Web as a graph, induced in various ways by links among pages, links among hosts, or other similar networks. Theaimofthe2004WorkshoponAlgorithmsandModelsfortheWeb-Graph was to further the understanding of these Web-induced graphs, and stimulate the development of high-performance algorithms and applications that use the graphstructureoftheWeb.Theworkshopwasmeantbothtofosteranexchange of ideas among the diverse set of researchers already involved in this topic, and to act as an introduction for the larger community to the state of the art in this area. This was the third edition of a very successful workshop on this topic, WAW 2002 was held in Vancouver, Canada, in conjunction with the 43rd - nual IEEE Symposium on Foundations of Computer Science, FOCS 2002, and WAW 2003 was held in Budapest, Hungary, in conjunction with the 12th Int- national World Wide Web Conference, WWW 2003. This was the ?rst edition of the workshop with formal proceedings.
R 1,540.79
Adaptive Processing of Sequences and Data Structures
This book is devoted to adaptive processing of structured information similar to flexible and intelligent information processing by humans - in contrast to merely sequential processing of predominantly symbolic information within a deterministic framework. Adaptive information processing allows for a mixture of sequential and parallel processing of symbolic as well as subsymbolic information within deterministic and probabilistic frameworks.The book originates from a summer school held in September 1997 and thus is ideally suited for advanced courses on adaptive information processing and advanced learning techniques or for self-instruction. Research and design professionals active in the area of neural information processing will find it a valuable state-of-the-art survey.
R 1,580.61
Recent Advances in Memetic Algorithms
Memetic algorithms are evolutionary algorithms that apply a local search process to refine solutions to hard problems. Memetic algorithms are the subject of intense scientific research and have been successfully applied to a multitude of real-world problems ranging from the construction of optimal university exam timetables, to the prediction of protein structures and the optimal design of space-craft trajectories. This monograph presents a rich state-of-the-art gallery of works on memetic algorithms. Recent Advances in Memetic Algorithms is the first book that focuses on this technology as the central topical matter. This book gives a coherent, integrated view on both good practice examples and new trends including a concise and self-contained introduction to memetic algorithms. It is a necessary read for postgraduate students and researchers interested in recent advances in search and optimization technologies based on memetic algorithms, but can also be used as complement to undergraduate textbooks on artificial intelligence.
R 6,020.68
Seriation in Combinatorial and Statistical Data Analysis
This monograph offers an original broad and very diverse exploration of the seriation domain in data analysis, together with building a specific relation to clustering.Relative to a data table crossing a set of objects and a set of descriptive attributes, the search for orders which correspond respectively to these two sets is formalized mathematically and statistically.State-of-the-art methods are created and compared with classical methods and a thorough understanding of the mutual relationships between these methods is clearly expressed. The authors distinguish two families of methods:Geometric representation methodsAlgorithmic and Combinatorial methodsOriginal and accurate methods are provided in the framework for both families. Their basis and comparison is made on both theoretical and experimental levels. The experimental analysis is very varied and very comprehensive. Seriation in Combinatorial and Statistical Data Analysis has a unique character in the literature falling within the fields of Data Analysis, Data Mining and Knowledge Discovery. It will be a valuable resource for students and researchers in the latter fields.
R 5,603.54
R 5,008.09
Algorithms and Model Formulations in Mathematical Programming
The NATO Advanced Research Workshop (ARW) "Algorithms and Model Formulations in Mathematical Programming" was held at Chr. Michelsen Institute in Bergen, Norway, from June 15 to June 19, 1987. The ARW was organized on behalf of the Committee on Algorithms (COAL) of the Mathematical Programming Society (MPS). Co-directors were Jan Telgen (Van Dien+Co Organisatie, Utrecht, The Netherlands) and Roger J-B Wets (The University of California at Davis, USA). 43 participants from 11 countries attended the ARW. The workshop was organized such that each day started with a - minute keynote presentation, followed by a 45-minute plenary discussion. The first part of this book contains the contributions of the five keynote speakers. The plenary discussions were taped, and the transcripts given to the keynote speakers. They have treated the transcripts differently, some by working the discussions into their papers, others by adding a section which sums up the discussions. The plenary discussions were very interesting and stimulating due to active participation of the audience. The five keynote speakers were asked to view the topic of the workshop, the interaction between algorithms and model formulations, from different perspectives. On the first day of the workshop Professor Alexander H.G. Rinnooy Kan (Erasmus University, Rotterdam, The Netherlands) put the theme into a larger context by his talk "Mathematical programming as an intellectual activity". This is an article of importance to any mathematical programmer who is interested in his field's history and present state.
R 2,015.00
Linear Programming and Algorithms for Communication Networks
Explaining how to apply to mathematical programming to network design and control, Linear Programming and Algorithms for Communication Networks: A Practical Guide to Network Design, Control, and Management fills the gap between mathematical programming theory and its implementation in communication networks. From the basics all the way through to more advanced concepts, its comprehensive coverage provides readers with a solid foundation in mathematical programming for communication networks. Addressing optimization problems for communication networks, including the shortest path problem, max flow problem, and minimum-cost flow problem, the book covers the fundamentals of linear programming and integer linear programming required to address a wide range of problems. It also: Examines several problems on finding disjoint paths for reliable communicationsAddresses optimization problems in optical wavelength-routed networksDescribes several routing strategies for maximizing network utilization for various traffic-demand modelsConsiders routing problems in Internet Protocol (IP) networksPresents mathematical puzzles that can be tackled by integer linear programming (ILP)Using the GNU Linear Programming Kit (GLPK) package, which is designed for solving linear programming and mixed integer programming problems, it explains typical problems and provides solutions for communication networks. The book provides algorithms for these problems as well as helpful examples with demonstrations. Once you gain an understanding of how to solve LP problems for communication networks using the GLPK descriptions in this book, you will also be able to easily apply your knowledge to other solvers.
R 2,944.35
Approximation and Online Algorithms
This book constitutes the thoroughly refereed post-workshop proceedings of the 12th International Workshop on Approximation and Online Algorithms, WAOA 2014, held in Wrocław, Poland, in September 2014 as part of ALGO 2014. The 22 revised full papers presented were carefully reviewed and selected from 49 submissions. They cover a wide range of topics such as coloring and partitioning, competitive analysis, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems.
R 2,171.09
Algorithms and Protocols for Wireless Sensor Networks
A one-stop resource for the use of algorithms and protocols in wireless sensor networks From an established international researcher in the field, this edited volume provides readers with comprehensive coverage of the fundamental algorithms and protocols for wireless sensor networks. It identifies the research that needs to be conducted on a number of levels to design and assess the deployment of wireless sensor networks, and provides an in-depth analysis of the development of the next generation of heterogeneous wireless sensor networks. Divided into nineteen succinct chapters, the book covers: mobility management and resource allocation algorithms; communication models; energy and power consumption algorithms; performance modeling and simulation; authentication and reputation mechanisms; algorithms for wireless sensor and mesh networks; and algorithm methods for pervasive and ubiquitous computing; among other topics. Complete with a set of challenging exercises, this book is a valuable resource for electrical engineers, computer engineers, network engineers, and computer science specialists. Useful for instructors and students alike, Algorithms and Protocols for Wireless Sensor Networks is an ideal textbook for advanced undergraduate and graduate courses in computer science, electrical engineering,and network engineering.
R 5,730.00
Parallel Algorithms
This book is an introduction to the field of parallel algorithms and the underpinning techniques to realize the parallelization. The emphasis is on designing algorithms within the timeless and abstracted context of a high-level programming language. The focus of the presentation is on practical applications of the algorithm design using different models of parallel computation. Each model is illustrated by providing an adequate number of algorithms to solve some problems that quite often arise in many applications in science and engineering.The book is largely self-contained, presuming no special knowledge of parallel computers or particular mathematics. In addition, the solutions to all exercises are included at the end of each chapter.The book is intended as a text in the field of the design and analysis of parallel algorithms. It includes adequate material for a course in parallel algorithms at both undergraduate and graduate levels.
R 4,670.02
Algorithms - ESA '97
This book constitutes the refereed proceedings of the 5th Annual International European Symposium on Algorithms, ESA'97, held in Graz, Austria, September 1997.The 38 revised full papers presented were selected from 112 submitted papers. The papers address a broad spectrum of theoretical and applicational aspects in algorithms theory and design. Among the topics covered are approximation algorithms, graph and network algorithms, combinatorial optimization, computational biology, computational mathematics, data compression, distributed computing, evolutionary algorithms, neural computing, online algorithms, parallel computing, pattern matching, and others.
R 1,594.28
Separable Type Representations of Matrices and Fast Algorithms
This two-volume work presents a systematic theoretical and computational study of several types of generalizations of separable matrices. The main attention is paid to fast algorithms (many of linear complexity) for matrices in semiseparable, quasiseparable, band and companion form. The work is focused on algorithms of multiplication, inversion and description of eigenstructure and includes a large number of illustrative examples throughout the different chapters. The second volume, consisting of four parts, addresses the eigenvalue problem for matrices with quasiseparable structure and applications to the polynomial root finding problem. In the first part the properties of the characteristic polynomials of principal leading submatrices, the structure of eigenspaces and the basic methods to compute eigenvalues are studied in detail for matrices with quasiseparable representation of the first order. The second part is devoted to the divide and conquer method, with the main algorithms being derived also for matrices with quasiseparable representation of order one. The QR iteration method for some classes of matrices with quasiseparable of any order representations is studied in the third part. This method is then used in the last part in order to get a fast solver for the polynomial root finding problem. The work is based mostly on results obtained by the authors and their coauthors. Due to its many significant applications and the accessible style the text will be useful to engineers, scientists, numerical analysts, computer scientists and mathematicians alike.
R 2,359.89
Algorithmic Aspects in Information and Management
This volume constitutes the proceedings of the 14th International Conference on Algorithmic Aspects in Information and Management, AAIM 2020, held in Jinhua, China in August 2020. The 39 full papers and 17 short papers presented were carefully reviewed and selected from 76 submissions. The papers deal with emerging important algorithmic problems with a focus on the fundamental background, theoretical technology development, and real-world applications associated with information and management analysis, modeling and data mining. Special considerations are given to algorithmic research that was motivated by real-world applications.
R 2,230.90
Computing and Combinatorics
This three-volume set LNCS 15161, 15162 and 15163 constitutes the refereed proceedings of the 30th International Conference, COCOON 2024, held in Shanghai, China, during August 23–25, 2024.The 90 full papers and 6 short papers were carefully reviewed and selected from 277 submissions. COCOON 2024 provided an excellent venue for researchers working in the area of algorithms, theory of computation, computational complexity, and combinatorics related to computing.
R 2,142.74
Algorithmic Aspects in Information and Management
This volume constitutes the proceedings of the 13th International Conference on Algorithmic Aspects in Information and Management, AAIM 2019, held in Bejing, China in August 2019.The 31 full papers presented were carefully reviewed and selected. The papers deal with most aspects of theoretical computer science and their applications. Special considerations are given to algorithmic research that is motivated by real-world applications.
R 2,184.18
Evolutionary Algorithms and Metaheuristics in Civil Engineering and Construction Management
This book focuses on civil and structural engineering and construction management applications. The contributions constitute modified, extended and improved versions of research presented at the minisymposium organized by the editors at the ECCOMAS conference on this topic in Barcelona 2014.
R 4,245.88
R 4,445.00
Grammatical Inference: Algorithms and Applications
The Fifth International Colloquium on Grammatical Inference (ICGI-2000) was heldinLisbononSeptember11-13th,2000.ICGI-2000wasthe?fthinaseriesof successfulbiennialinternationalconferencesintheareaofgrammaticalinference. Previous conferences were held in Essex, U.K.; Alicante, Spain; Montpellier, France; and Ames, Iowa, USA. This series of meetings seeks to provide a forum for the presentation and discussion of original research on all aspects of grammatical inference. Gram- tical inference, the process of inferring grammar from given data, is a ?eld that is not only challenging from a purely scienti?c standpoint but also ?nds many applications in real world problems. Despitethefactthatgrammaticalinferenceaddressesproblemsinarelatively narrow area, it uses techniques from many domains, and intersects a number of di?erent disciplines. Researchers in grammatical inference come from ?elds as diverse as machine learning, theoretical computer science, computational ling- stics, pattern recognition and arti?cial neural networks.From a practical standpoint, applications in areas such as natural language acquisition, computational biology, structural pattern recognition, information retrieval, text processing and adaptive intelligent agents have either been - monstrated or proposed in the literature. ICGI-2000 was held jointly with CoNLL-2000, the Computational Natural Language Learning Workshop and LLL-2000, the Second Learning Language in LogicWorkshop.Thetechnicalprogramincludedthepresentationof24accepted papers (out of 35 submitted) as well as joint sessions with CoNLL and LLL. A tutorial program organized by Gabriel Pereira Lopes took place after the meetings and included tutorials by Raymond Mooney, Gregory Grefenstette, Walter Daelemans, Ant' onio Ribeiro, Joaquim Ferreira da Silva, Gael Dias, Nuno Marques,VitorRossio,Jo" aoBalsaandAlexandreAgostini.Thejointrealization of these events represents a unique opportunity for researchers in these related ?elds to interact and exchange ideas.
R 2,015.00
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
R 397.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
