This book constitutes the documentation of the results achieved within a proirity program on spatial cognition established by the German Science Foundation (DFG) in 1996 involving 13 research groups in Germany and leading scientists from abroad. The 22 revised full papers included were first presented during a colloquium in fall 1997 and then went through a second round of thorough reviewing. The book is organized into three parts on spatial knowledge acquisition and spatial memory, formal and linguistic models, and navigation in real and virtual worlds. All in all the book is a unique report on the state-of-the art in the interdisciplinary research field of spatial cognition and its potential applications.
This book presents the history and state of the art of universal routing strategies, which can be applied to networks independently of their respective topologies. It opens with a self-contained introduction, accessible also to newcomers. The main original results are new universal network protocols for store-and-forward and wormhole routing with small buffers or without buffers; these results are presented in detail and their potential applications are discussed. The book ends with a summary of open problems and an outlook of future directions in the area of routing theory.
Combinatorial optimization problems are of high academical and practical importance. Unfortunately, many of them belong to the class of NP-hard problems and are therefore intractable. In other words, as their dimension increases, the time needed by exact methods to find an optimal solution grows exponentially. Metaheuristics are approximate methods for attacking these problems. An approximate method is a technique that is applied in order to find a good enough solution in a reasonable amount of time. Examples of metaheuristics are simulated annealing, tabu search, evolutionary computation, and ant colony optimization (ACO), the subject of this book. The contributions of this book to ACO research are twofold. First, some new theoretical results are proven that improve our understanding of how ACO works. Second, a new framework for ACO algorithms is proposed that is shown to perform at the state-of-the-art level on some important combinatorial optimization problems such as the k-cardinality tree problem and the group shop scheduling problem, which is a general shop scheduling problem that includes among others the well-known job shop scheduling and the open shop scheduling problems.
This book constitutes the documentation of the results achieved within a proirity program on spatial cognition established by the German Science Foundation (DFG) in 1996 involving 13 research groups in Germany and leading scientists from abroad. The 22 revised full papers included were first presented during a colloquium in fall 1997 and then went through a second round of thorough reviewing. The book is organized into three parts on spatial knowledge acquisition and spatial memory, formal and linguistic models, and navigation in real and virtual worlds. All in all the book is a unique report on the state-of-the art in the interdisciplinary research field of spatial cognition and its potential applications.
This book constitutes the refereed proceedings of the Third International Conference on Geographic Information Secience, GIScience 2004, held in Adelphi, MD, USA in October 2004. The 25 revised full papers presented were carefully reviewed and selected from many submissions. Among the topics addressed are knowledge mapping, geo-self-organizing maps, space syntax, geospatial data integration, geospatial modeling, spatial search, spatial indexing, spatial data analysis, mobile ad-hoc geosensor networks, map comparison, spatiotemporal relations, ontologies, and geospatial event modeling.
Reprint of the original, first published in 1859. The publishing house Anatiposi publishes historical books as reprints. Due to their age, these books may have missing pages or inferior quality. Our aim is to preserve these books and make them available to the public so that they do not get lost.
This will help us customize your experience to showcase the most relevant content to your age group
Please select from below
Login
Not registered?
Sign up
Already registered?
Success – Your message will goes here
We'd love to hear from you!
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.