تحسين النتائح
ترتيب حسب
من
الى
الصفحة 1
الصفحة 1
Complexity of Constraints : An Overview of Current Research Themes
This state-of-the-art survey contains the papers that were invited by the organizers after conclusion of an International Dagstuhl-Seminar on Complexity of Constraints, held in Dagstuhl Castle, Germany, in October 2006.
Bioinformatics : Problem Solving Paradigms
This book highlights basic paradigms of problem analysis and algorithm design in the context of core bioinformatics problems. Mathematically demanding themes are put across to the reader by properly chosen representations with the aid of lots of illustrations.
Applications of Graph Transformations with Industrial Relevance ; 3rd International Symposium, AGTIVE 2007, Kassel, Germany, October 10-12, 2007, Revised Selected and Invited Papers
This book constitutes the thoroughly refereed post-conference proceedings of the Third International Symposium on Applications of Graph Transformations, AGTIVE 2007, held in Kassel, Germany, in October 2007.
Ant Colony Optimization and Swarm Intelligence ; 6th International Conference, ANTS 2008, Brussels, Belgium, September 22-24, 2008. Proceedings
This book constitutes the refereed proceedings of the 6th International Workshop on Ant Colony Optimization and Swarm Intelligence, ANTS 2008, held in Brussels, Belgium, in September 2008.
Algorithms in Bioinformatics ; 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008. Proceedings
This book constitutes the refereed proceedings of the 8th International Workshop on Algorithms in Bioinformatics, WABI 2008, held in Karlsruhe, Germany, in September 2008 as part of the ALGO 2008 meeting.
Algorithms for Sensor and Ad Hoc Networks : Advanced Lectures
Thousands of mini computers (comparable to a stick of chewing gum in size), equipped with sensors, are deployed in some terrain or other. After activation the sensors form a self-organized network and provide data, for example about a forthcoming earthquake. The trend towards wireless communication increasingly affects electronic devices in almost every sphere of life. Conventional wireless networks rely on infrastructure such as base stations; mobile devices interact with these base stations in a client/server fashion. In contrast, current research is focusing on networks that are completely unstructured, but are nevertheless able to communicate (via several hops) with each other, despite the low coverage of their antennas. Such systems are called sensor or ad hoc networks, depending on the point of view and the application. Wireless ad hoc and sensor networks have gained an incredible research momentum. Computer scientists and engineers of all flavors are embracing the area. Sensor networks have been adopted by researchers in many fields: from hardware technology to operating systems, from antenna design to databases, from information theory to networking, from graph theory to computational geometry.
Algorithms and data structures : The Basic Toolbox
This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language.
Algorithms – ESA 2007 ; 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings
This book presented submissions in the engineering and applications track. The papers address all current subjects in algorithmics reaching from design and analysis issues of algorithms over to real-world applicat.
Advanced Methods for Inconsistent Knowledge Management
This book presents a unified and systematic description of a wide class of miscellaneous problems of inconsistent knowledge management, analyzed by traditional mathematical methods using relational and logical representations.
A Modular Calculus for the Average Cost of Data Structuring
This volume, with forewords by Greg Bollella and Dana Scott, presents novel programs based on the new advances in this area, including the first randomness-preserving version of Heapsort. Programs are provided, along with derivations of their average-case time, to illustrate the radically different approach to average-case timing. The automated static timing tool applies the Modular Calculus to extract the average-case running time of programs directly from their MOQA code.
