Seems you have not registered as a member of localhost.saystem.shop!
You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.
Meta-Heuristics
Meta-heuristics have developed dramatically since their inception in the early 1980s. They have had widespread success in attacking a variety of practical and difficult combinatorial optimization problems. These families of approaches include, but are not limited to greedy random adaptive search procedures, genetic algorithms, problem-space search, neural networks, simulated annealing, tabu search, threshold algorithms, and their hybrids. They incorporate concepts based on biological evolution, intelligent problem solving, mathematical and physical sciences, nervous systems, and statistical mechanics. Since the 1980s, a great deal of effort has been invested in the field of combinatorial opt...
Genetic Criticism in Motion
Genetic criticism investigates creative processes by analysing manuscripts and other archival sources. It sheds light on authors’ working practices and the ways works are developed on the writer’s desk or in the artist’s studio. This book provides a cross-section of current international trends in genetic criticism, half a century after the birth of the discipline in Paris. The last two decades have witnessed an expansion of the field of study with new kinds of research objects and new forms of archival material, along with various kinds of interdisciplinary intersections and new theoretical perspectives. The essays in this volume represent various European literary and scholarly traditions discussing creative processes from Polish poetry to French children’s literature, as well as topical issues such as born-digital literature and the application of forensic methodology to manuscript studies. The book is intended for scholars and students of literary criticism and textual scholarship, together with anyone interested in the working practices of writers, illustrators, and editors.
Logistics Systems: Design and Optimization
In a context of global competition, the optimization of logistics systems is inescapable. Logistics Systems: Design and Optimization falls within this perspective and presents twelve chapters that well illustrate the variety and the complexity of logistics activities. Each chapter is written by recognized researchers who have been commissioned to survey a specific topic or emerging area of logistics. The first chapter, by Riopel, Langevin, and Campbell, develops a framework for the entire book. It classifies logistics decisions and highlights the relevant linkages to logistics decisions. The intricacy of these linkages demonstrates how thoroughly the decisions are interrelated and underscores the complexity of managing logistics activities. Each of the chapters focus on quantitative methods for the design and optimization of logistics systems.
Graph Theory, Combinatorics and Algorithms
Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering. The book contains eleven chapters written by experts in their respective fields, and covers a wide spectrum of high-interest problems across these discipline domains. Among the contributing authors are Richard Karp of UC Berkeley and Robert Tarjan of Princeton; both are at the pinnacle of research scholarship in Graph Theory and Combinatorics. The chapters from the contributing authors focus on "real world" applications, all of which will be of considerable interest across the areas of Operations Research, Computer Science, Applied Mathematics, and Engineering. These problems include Internet congestion control, high-speed communication networks, multi-object auctions, resource allocation, software testing, data structures, etc. In sum, this is a book focused on major, contemporary problems, written by the top research scholars in the field, using cutting-edge mathematical and computational techniques.
Local Search in Combinatorial Optimization
In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting ever-increasing attention. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in reasonable time. Local Search in Combinatorial Optimization covers local search and its variants from both a theoretical and practical point of view, each topic discussed by a leading authority. This book is an important reference and invaluable source of inspiration for students and researchers in discrete mathematics, computer science, oper...
Essentials of Logistics and Management
The Essentials of Logistics and Management provides a broad expertly guided investigation into the knowledge required to maximize the practice of logistics in a way that contributes to a company's growth. The text elaborates upon a conceptual framework in which the role of all stakeholders and possible logistics are analyzed in a systematic approach that explores customer relations management, interactive information support, production optimization, and operations management, as well as human resources and resource allocation. The purpose of this book is help managers employ vision and strategy in developing a methodology that identifies, evaluates, and utilizes all critical factors.
Observing Writing
Observing writing: Insights from Keystroke Logging and Handwriting is a timely volume appearing twelve years after the Studies in Writing volume Computer Keystroke Logging and Writing (Sullivan & Lindgren, 2006). The 2006 volume provided the reader with a fundamental account of keystroke logging, a methodology in which a piece of software records every keystroke, cursor and mouse movement a writer undertakes during a writing session. This new volume highlights current theoretical and applied research questions in keystroke logging and handwriting research that observes writing. In this volume, contributors from a range of disciplines, including linguistics, psychology, neuroscience, modern languages, and education, present their research that considers the cognitive and socio-cultural complexities of writing texts in academic and professional settings.
The Zeroth Book of Graph Theory
Marking 94 years since its first appearance, this book provides an annotated translation of Sainte-Laguë's seminal monograph Les réseaux (ou graphes), drawing attention to its fundamental principles and ideas. Sainte-Laguë's 1926 monograph appeared only in French, but in the 1990s H. Gropp published a number of English papers describing several aspects of the book. He expressed his hope that an English translation might sometime be available to the mathematics community. In the 10 years following the appearance of Les réseaux (ou graphes), the development of graph theory continued, culminating in the publication of the first full book on the theory of finite and infinite graphs in 1936 by Dénes König. This remained the only well-known text until Claude Berge's 1958 book on the theory and applications of graphs. By 1960, graph theory had emerged as a significant mathematical discipline of its own. This book will be of interest to graph theorists and mathematical historians.
Optimization Problems in Self-Organizing Networks
Modern computer networks or wireless ad-hoc networks offer a wide range of interesting optimization problems. Usual optimization goals are the minimization of the message delay in a Peer-to-Peer system or the minimization of the energy consumption of a wireless network. This thesis presents different kinds of algorithms to solve such optimization problems. Starting from the mathematical formulations for these problems, various global view optimization algorithms are presented. These algorithms are based on evolutionary algorithms and local search or similar heuristics. They can be used to quickly find near-optimal solutions, if a global view of the network is possible. As the participants in a computer network or a wireless ad-hoc network are autonomous nodes, distributed algorithms can be designed that enable these nodes to collectively solve the optimization problem. Four distributed algorithms are formulated and evaluated in this thesis, thus laying grounds for distributed optimization of networks. Using these algorithms, the network can be modelled as a self-optimizing network and the optimization problem can be approached without global view.
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
This book constitutes the refereed proceedings of the 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2008, held in Paris, France, in May 2008. The 18 revised long papers and 22 revised short papers presented together with 3 invited talks were carefully reviewed and selected from 130 submissions. The papers describe current research in the fields of constraint programming, artificial intelligence, and operations research to explore ways of solving large-scale, practical optimization problems through integration and hybridization of the fields' different techniques.
