Search results for "Data Structures and Algorithms in Java"
Items we need to order for you
Stochastic Algorithms: Foundations and Applications
This volume constitutes the proceedings of the 3rd Symposium on Stochastic Algorithms, Foundations and Applications (SAGA 2005), held in Moscow, R- sia, at Moscow State University on October 20-22, 2005. The symposium was organized by the Department of Discrete Mathematics, Faculty of Mechanics and Mathematics of Moscow State University and was partially supported by the Russian Foundation for Basic Research under Project No. 05-01-10140-?. The SAGA symposium series is a biennial meeting which started in 2001 in Berlin, Germany(LNCS vol. 2264). The second symposium was held in Sept- ber 2003 at the University of Hertfordshire, Hat?eld, UK (LNCS vol. 2827). Sincethe?rstsymposiuminBerlinin2001,anincreasedinterestintheSAGA series can be noticed. For SAGA 2005, we received submissions from China, the European Union, Iran, Japan, Korea, Russia, SAR Hong Kong, Taiwan, and USA, fromwhich 14 papers were?nally selected for publication after a thorough reviewing process. The contributed papers included in this volume cover both theoretical as well as applied aspects of stochastic computations, which is one of the main aims of the SAGA series. Furthermore, ?ve invited lectures were delivered at SAGA 2005: The talk by Alexander A.Sapozhenko (Moscow State University) summarizes results on the container method, a technique that is used to solve enumeration problems for various combinatorial structures and which has - merous applications in the design andanalysisof stochasticalgorithms. Christos D. Zaroliagis (University of Patras) presented recent advances in multiobjective optimization.
R 1,548.87
Nature-Inspired Algorithms for Optimisation
Nature-Inspired Algorithms have been gaining much popularity in recent years due to the fact that many real-world optimisation problems have become increasingly large, complex and dynamic. The size and complexity of the problems nowadays require the development of methods and solutions whose efficiency is measured by their ability to find acceptable results within a reasonable amount of time, rather than an ability to guarantee the optimal solution. This volume 'Nature-Inspired Algorithms for Optimisation' is a collection of the latest state-of-the-art algorithms and important studies for tackling various kinds of optimisation problems. It comprises 18 chapters, including two introductory chapters which address the fundamental issues that have made optimisation problems difficult to solve and explain the rationale for seeking inspiration from nature. The contributions stand out through their novelty and clarity of the algorithmic descriptions and analyses, and lead the way to interesting and varied new applications.
R 7,655.74
Algorithms for Image Processing and Computer Vision
A cookbook of algorithms for common image processing applications Thanks to advances in computer hardware and software, algorithms have been developed that support sophisticated image processing without requiring an extensive background in mathematics. This bestselling book has been fully updated with the newest of these, including 2D vision methods in content-based searches and the use of graphics cards as image processing computational aids. It’s an ideal reference for software engineers and developers, advanced programmers, graphics programmers, scientists, and other specialists who require highly specialized image processing. Algorithms now exist for a wide variety of sophisticated image processing applications required by software engineers and developers, advanced programmers, graphics programmers, scientists, and related specialistsThis bestselling book has been completely updated to include the latest algorithms, including 2D vision methods in content-based searches, details on modern classifier methods, and graphics cards used as image processing computational aidsSaves hours of mathematical calculating by using distributed processing and GPU programming, and gives non-mathematicians the shortcuts needed to program relatively sophisticated applications. Algorithms for Image Processing and Computer Vision, 2nd Edition provides the tools to speed development of image processing applications.
R 3,257.00
Algorithmic Aspects in Information and Management
This two-volume set LNCS 15179-15180 constitutes the refereed proceedings of the 18th International Conference on Algorithmic Aspects in Information and Management, AAIM 2024, which took place virtually during September 21-23, 2024.The 45 full papers presented in these two volumes were carefully reviewed and selected from 76 submissions. The papers are organized in the following topical sections:Part I: Optimization and applications; submodularity, management and others,Part II: Graphs and networks; quantum and others.
R 2,552.89
Optimization of Structures and Components
Written by an international group of active researchers in the field, this volume presents innovative formulations and applied procedures for sensitivity analysis and structural design optimization. Eight chapters discuss subjects ranging from recent developments in the determination and application of topological gradients, to the use of evolutionary algorithms and meta-models to solve practical engineering problems. With such a comprehensive set of contributions, the book is a valuable source of information for graduate students and researchers entering or working in the matter.
R 3,335.21
Algorithms in Combinatorial Geometry
Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field.
R 2,791.87
R 5,266.47
Hybrid Algorithms for Service, Computing and Manufacturing Systems
Hybrid Algorithms for Service, Computing and Manufacturing Systems: Routing and Scheduling Solutions explores research developments and applications from an interdisciplinary perspective that combines approaches from operations research, computer science, artificial intelligence, and applied computational mathematics. Contributions cover a range of hybrid algorithm theory and practice as it relates to routing, scheduling, and real-life applications.
R 6,993.89
Classification Algorithms for Codes and Designs
A new starting-point and a new method are requisite, to insure a complete [classi?cation of the Steiner triple systems of order 15]. This method was furnished, and its tedious and di?cult execution und- taken, by Mr. Cole. F. N. Cole, L. D. Cummings, and H. S. White (1917) [129] The history of classifying combinatorial objects is as old as the history of the objects themselves. In the mid-19th century, Kirkman, Steiner, and others became the fathers of modern combinatorics, and their work – on various objects, including (what became later known as) Steiner triple systems – led to several classi?cation results. Almost a century earlier, in 1782, Euler [180] published some results on classifying small Latin squares, but for the ?rst few steps in this direction one should actually go at least as far back as ancient Greece and the proof that there are exactly ?ve Platonic solids. One of the most remarkable achievements in the early, pre-computer era is the classi?cation of the Steiner triple systems of order 15, quoted above. An onerous task that, today, no sensible person would attempt by hand calcu- tion. Because, with the exception of occasional parameters for which com- natorial arguments are e?ective (often to prove nonexistence or uniqueness), classi?cation in general is about algorithms and computation.
R 3,596.67
Compiler Construction Using Java, JavaCC, and Yacc
Broad in scope, involving theory, the application of that theory, and programming technology, compiler construction is a moving target, with constant advances in compiler technology taking place. Today, a renewed focus on do-it-yourself programming makes a quality textbook on compilers, that both students and instructors will enjoy using, of even more vital importance. This book covers every topic essential to learning compilers from the ground up and is accompanied by a powerful and flexible software package for evaluating projects, as well as several tutorials, well-defined projects, and test cases.
R 4,004.00
Grammatical Inference: Algorithms and Applications
The Sixth International Colloquium on Grammatical Inference (ICGI2002) was held in Amsterdam on September 23-25th, 2002. ICGI2002 was the sixth in a series of successful biennial international conferenceson the area of grammatical inference. Previous meetings were held in Essex, U.K.; Alicante, Spain; Mo- pellier, France; Ames, Iowa, USA; Lisbon, Portugal. This series of meetings seeks to provide a forum for the presentation and discussion of original research on all aspects of grammatical inference. Gr- matical inference, the process of inferring grammars from given data, is a ?eld that not only is challenging from a purely scienti?c standpoint but also ?nds many applications in real-world problems. Despite the fact that grammatical inference addresses problems in a re- tively narrow area, it uses techniques from many domains, and is positioned at the intersection of a number of di?erent disciplines. Researchers in grammatical inference come from ?elds as diverse as machine learning, theoretical computer science, computational linguistics, pattern recognition, and arti?cial neural n- works. From a practical standpoint, applications in areas like natural language - quisition, computational biology, structural pattern recognition, information - trieval, text processing, data compression and adaptive intelligent agents have either been demonstrated or proposed in the literature. The technical program included the presentation of 23 accepted papers (out of 41 submitted). Moreover, for the ?rst time a software presentation was or- nized at ICGI. Short descriptions of the corresponding software are included in these proceedings, too.
R 2,178.59
Intelligent Algorithms for Packing and Cutting Problem
This book investigates in detail the two-dimensional packing and cutting problems in the field of operations research and management science. It introduces the mathematical models and intelligent solving algorithms for these problems, as well as their engineering applications. Most intelligent methods reported in this book have already been applied in reality, which can provide reference for the engineers. The presented novel methods for the two-dimensional packing problem provide a new way to solve the problem for researchers interested in operations research or computer science. This book also introduces three new variants of packing problems and their solving methods, which offer a different research direction. The book is intended for undergraduate and graduate students who are interested in the solving methods for packing and cutting problems, researchers investigating the application of intelligent algorithms, scientists studying the theory of the operations research and CAM software developers working on integration of packing and cutting problem.
R 6,228.00
Algorithms for Sensor and Ad Hoc Networks
This monograph presents the outcome of a GI-Dagstuhl Seminar held in Dagstuhl Castle in November 2005. It gives a first overview of algorithmic results on wireless ad hoc and sensor networks. Many chapters deal with distributed algorithms. Importance is attached to topics that combine both interesting aspects of wireless networks and attractive algorithmic methods. Each chapter provides a survey of some part of the field, while selected results are described in more detail.
R 2,386.31
Jewels Of Stringology: Text Algorithms
The term “stringology” is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most of them can be viewed as “algorithmic jewels” and deserve reader-friendly presentation. One of the main aims of the book is to present several of the most celebrated algorithms in a simple way by omitting obscuring details and separating algorithmic structure from combinatorial theoretical background. The book reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. The text can be viewed as a parade of algorithms in which the main purpose is to discuss the foundations of the algorithms and their interconnections. One can partition the algorithmic problems discussed into practical and theoretical problems. Certainly, string matching and data compression are in the former class, while most problems related to symmetries and repetitions in texts are in the latter. However, all the problems are interesting from an algorithmic point of view and enable the reader to appreciate the importance of combinatorics on words as a tool in the design of efficient text algorithms.In most textbooks on algorithms and data structures, the presentation of efficient algorithms on words is quite short as compared to issues in graph theory, sorting, searching, and some other areas. At the same time, there are many presentations of interesting algorithms on words accessible only in journals and in a form directed mainly at specialists. This book fills the gap in the book literature on algorithms on words, and brings together the many results presently dispersed in the masses of journal articles. The presentation is reader-friendly; many examples and about two hundred figures illustrate nicely the behaviour of otherwise very complex algorithms.
R 2,139.26
Tools and Algorithms for the Construction and Analysis of Systems
This book is Open Access under a CC BY licence.The LNCS 11427 and 11428 proceedings set constitutes the proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2019, which took place in Prague, Czech Republic, in April 2019, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019.The total of 42 full and 8 short tool demo papers presented in these volumes was carefully reviewed and selected from 164 submissions. The papers are organized in topical sections as follows:Part I: SAT and SMT, SAT solving and theorem proving; verification and analysis; model checking; tool demo; and machine learning.Part II: concurrent and distributed systems; monitoring and runtime verification; hybrid and stochastic systems; synthesis; symbolic verification; and safety and fault-tolerant systems.
R 2,387.19
Graphs, Algorithms, and Optimization
The second edition of this popular book presents the theory of graphs from an algorithmic viewpoint. The authors present the graph theory in a rigorous, but informal style and cover most of the main areas of graph theory. The ideas of surface topology are presented from an intuitive point of view. We have also included a discussion on linear programming that emphasizes problems in graph theory. The text is suitable for students in computer science or mathematics programs.
R 4,225.76
Algorithms and Architectures for Parallel Processing
This three-volume set LNCS 12452, 12453, and 12454 constitutes the proceedings of the 20th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2020, in New York City, NY, USA, in October 2020.The total of 142 full papers and 5 short papers included in this proceedings volumes was carefully reviewed and selected from 495 submissions.ICA3PP is covering the many dimensions of parallel algorithms and architectures, encompassing fundamental theoretical approaches, practical experimental projects, and commercial components and systems. As applications of computing systems have permeated in every aspects of daily life, the power of computing system has become increasingly critical. This conference provides a forum for academics and practitioners from countries around the world to exchange ideas for improving the efficiency, performance, reliability, security and interoperability of computing systems and applications. ICA3PP 2020 focus on two broad areas of parallel and distributed computing, i.e. architectures, algorithms and networks, and systems and applications.
R 4,347.75
Numerical Computations: Theory and Algorithms
The two-volume set LNCS 11973 and 11974 constitute revised selected papers from the Third International Conference on Numerical Computations: Theory and Algorithms, NUMTA 2019, held in Crotone, Italy, in June 2019. This volume, LNCS 11974, consists of 19 full and 32 short papers chosen among regular papers presented at the the Conference including also the paper of the winner (Lorenzo Fiaschi, Pisa, Italy) of The Springer Young Researcher Prize for the best NUMTA 2019 presentation made by a young scientist. The papers in part II explore the advanced research developments in such interconnected fields as local and global optimization, machine learning, approximation, and differential equations. A special focus is given to advanced ideas related to methods and applications using emerging computational paradigms.
R 2,215.47
Wireless Algorithms, Systems, and Applications
This book constitutes the proceedings of the 13th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2018, held in Tianjin, China, in June 2018.The 59 full papers and 18 short papers presented in this book were carefully reviewed and selected from 197 submissions. The papers cover various topics such as cognitive radio networks; wireless sensor networks; cyber-physical systems; distributed and localized algorithm design and analysis; information and coding theory for wireless networks; localization; mobile cloud computing; topology control and coverage; security and privacy; underwater and underground networks; vehicular networks; internet of things; information processing and data management; programmable service interfaces; energy-efficient algorithms; system and protocol design; operating system and middle-ware support; and experimental test-beds, models and case studies.
R 3,947.95
Foundations of Software Science and Computation Structures
This open access book constitutes the proceedings of the 23rd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 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 31 regular papers presented in this volume were carefully reviewed and selected from 98 submissions.The papers cover topics such as categorical models and logics; language theory, automata, and games; modal, spatial, and temporal logics; type theory and proof theory; concurrency theory and process calculi; rewriting theory; semantics of programming languages; program analysis, correctness, transformation, and verification; logics of programming; software specification and refinement; models of concurrent, reactive, stochastic, distributed, hybrid, and mobile systems; emerging models of computation; logical aspects of computational complexity; models of software security; and logical foundations of data bases.
R 2,041.10
Power of Algorithms
To examine, analyze, and manipulate a problem to the point of designing an algorithm for solving it is an exercise of fundamental value in many fields. With so many everyday activities governed by algorithmic principles, the power, precision, reliability and speed of execution demanded by users have transformed the design and construction of algorithms from a creative, artisanal activity into a full-fledged science in its own right. This book is aimed at all those who exploit the results of this new science, as designers and as consumers. The first chapter is an overview of the related history, demonstrating the long development of ideas such as recursion and more recent formalizations such as computability. The second chapter shows how the design of algorithms requires appropriate techniques and sophisticated organization of data. In the subsequent chapters the contributing authors present examples from diverse areas – such as routing and networking problems, Web search, information security, auctions and games, complexity and randomness, and the life sciences – that show how algorithmic thinking offers practical solutions and also deepens domain knowledge. The contributing authors are top-class researchers with considerable academic and industrial experience; they are also excellent educators and communicators and they draw on this experience with enthusiasm and humor. This book is an excellent introduction to an intriguing domain and it will be enjoyed by undergraduate and postgraduate students in computer science, engineering, and mathematics, and more broadly by all those engaged with algorithmic thinking.
R 1,832.00
Nature-Inspired Computation in Data Mining and Machine Learning
This book reviews the latest developments in nature-inspired computation, with a focus on the cross-disciplinary applications in data mining and machine learning. Data mining, machine learning and nature-inspired computation are current hot research topics due to their importance in both theory and practical applications. Adopting an application-focused approach, each chapter introduces a specific topic, with detailed descriptions of relevant algorithms, extensive literature reviews and implementation details. Covering topics such as nature-inspired algorithms, swarm intelligence, classification, clustering, feature selection, cybersecurity, learning algorithms over cloud, extreme learning machines, object categorization, particle swarm optimization, flower pollination and firefly algorithms, and neural networks, it also presents case studies and applications, including classifications of crisis-related tweets, extraction of named entities in the Tamil language, performance-based prediction of diseases, and healthcare services. This book is both a valuable a reference resource and a practical guide for students, researchers and professionals in computer science, data and management sciences, artificial intelligence and machine learning.
R 5,261.81
Tools and Algorithms for the Construction and Analysis of Systems
This book presents the refereed proceedings of the Second International Workshop on Tools and Algorithms for the Construction and Analysis of Systems, TACAS '96, held in Passau, Germany in March 1996.The book presents 19 revised full papers selected from a total of 47 submissions together with 11 tool presentations and 3 invited papers. The collection of papers addresses all current aspects of the design and analysis of distributed systems; the volume is organized in topical sections on tools, model checking and testing, security, models and methods, case studies, and logic and programs.
R 1,581.34
Refactoring in Java
Master code refactoring techniques, improve code quality, design, and maintainability, and boost your development productivity with this comprehensive handbookKey FeaturesGet a thorough understanding of code refinement for enhanced codebase efficiencyWork with real-world examples and case studies for hands-on learning and applicationFocus on essential tools, emphasizing development productivity and robust coding habitsPurchase of the print or Kindle book includes a free PDF eBookBook DescriptionRefactoring in Java serves as an indispensable guide to enhancing your codebase’s quality and maintainability.The book begins by helping you get to grips with refactoring fundamentals, including cultivating good coding habits and identifying red flags. You’ll explore testing methodologies, essential refactoring techniques, and metaprogramming, as well as designing a good architecture. The chapters clearly explain how to refactor and improve your code using real-world examples and proven techniques. Part two equips you with the ability to recognize code smells, prioritize tasks, and employ automated refactoring tools, testing frameworks, and code analysis tools. You’ll discover best practices to ensure efficient code improvement so that you can navigate complexities with ease. In part three, the book focuses on continuous learning, daily practices enhancing coding proficiency, and a holistic view of the architecture. You’ll get practical tips to mitigate risks during refactoring, along with guidance on measuring impact to ensure that you become an efficient software craftsperson.By the end of this book, you’ll be able to avoid unproductive programming or architecturing, detect red flags, and propose changes to improve the maintainability of your codebase.What you will learnRecognize and address common issues in your codeFind out how to determine which improvements are most importantImplement techniques such as using polymorphism instead of conditionsEfficiently leverage tools for streamlining refactoring processesEnhance code reliability through effective testing practicesDevelop the skills needed for clean and readable code presentationGet to grips with the tools you need for thorough code examinationApply best practices for a more efficient coding workflowWho this book is forThis book is for Java developers, software architects, and technical leads looking for a comprehensive guide to advancing their skills in software design and refactoring. The book is ideal for experienced Java enthusiasts, quality assurance engineers, and codebase maintainers as it provides practical insights, real-world examples, and essential patterns. Development managers who want to foster clean coding practices by using best practices for efficient workflows will also find this book useful.
R 1,563.00
Modeling Data Irregularities and Structural Complexities in Data Envelopment Analysis
In a relatively short period of time, data envelopment analysis (DEA) has grown into a powerful analytical tool for measuring and evaluating performance. DEA is computational at its core and this book is one of several Springer aim to publish on the subject. This work deals with the micro aspects of handling and modeling data issues in DEA problems. It is a handbook treatment dealing with specific data problems, including imprecise data and undesirable outputs.
R 3,853.32
Wireless Algorithms, Systems, and Applications
This book constitutes the proceedings of the 10th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2015, held in Qufu, Shandong, China, in August 2015.The 36 revised full papers presented together with 5 revised short papers and 42 invited papers were carefully reviewed and selected from 133 initial submissions. The papers present current trends, challenges, and state-of-the-art solutions related to various issues in wireless networks. Topics of interests include effective and efficient state-of-the-art algorithm design and analysis, reliable and secure system development and implementations, experimental study and testbed validation, and new application exploration in wireless networks..
R 1,649.83
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 3,557.12
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
