Page 1
Page 1
Web Communities : Analysis and Construction
Web community, defined as a set of Web-based documents with its own logical structure, is a flexible and efficient approach to support information retrieval and to implement various applications. Zhang and his co-authors explain how to construct and analyse Web communities based on information like Web document contents, hyperlinks, or user access logs. Their approaches combine results from Web search algorithms, Web clustering methods, and Web usage mining. They also detail the necessary preliminaries needed to understand the algorithms presented, and they discuss several successful existing applications. Researchers and students in information retrieval and Web search find in this all the necessary basics and methods to create and understand Web communities. Professionals developing Web applications will additionally benefit from the samples presented for their own designs and implementations.
Theory and Applications of Satisfiability Testing ; Vol. 3569 ; 8th International Conference, SAT 2005, St Andrews, Scotland, June 19-23, 2005, Proceedings
SAT is the classic problem of determining whether or not a propositional formula has a satisfying truth assignment. It was the first problem shown by Cook to be NP-complete. Despite its seemingly specialized nature, satisfiability testing has proved to extremely useful in a wide range of different disciplines, both from a practical as well as from a theoretical point of view. For example, work on SAT continues to provide insight into various fundamental problems in computation, and SAT solving technology has advanced to the point where it has become the most effective way of solving a number of practical problems. The SAT series of conferences are multidisciplinary conferences intended to bring together researchers from various disciplines who are interested in SAT. Topics of interest include, but are not limited to: proof systems and proof c- plexity; search algorithms and heuristics; analysis of algorithms; theories beyond the propositional; hard instances and random formulae; problem encodings; - dustrial applications; solvers and other tools.
Theory and Applications of Satisfiability Testing - SAT 2008 ; 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings
All current research issues in propositional and quantified Boolean formula satisfiability testing are covered, including but not limited to proof systems, proof complexity, search algorithms, heuristics, analysis of algorithms, hard instances, randomized formulae, problem encodings, industrial applications, solvers, simplifiers, tools, case studies and empirical results.
String Processing and Information Retrieval ; Vol. 4209 ; 13th International Conference, SPIRE 2006, Glasgow, UK, October 11-13, 2006, Proceedings
This volume contains the papers presented at the 13th International Symposium on String Processing and Information Retrieval (SPIRE), held October 11-13, 2006, in Glasgow, Scotland. The papers in this volume were selected from 102 papers submitted from over 20 di?erent countries in response to the Call for Papers.
Principles and Practice of Constraint Programming - CP 2002 ; 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002, Proceedings
This book constitutes the refereed proceedings of the 8th International Conference on Principles and Practice of Constraint Programming, CP 2002, held in Ithaca, NY, USA in September 2002. The 38 revised full papers and 6 innovative application papers as well as the 14 short papers presented toghether with 25 abstracts from contributions to the doctoral program were carefully reviewed and selected from 146 submissions. All current issues in constraint processing are addressed, ranging from theoretical and foundational issues to application in various fields.
Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics ; International Workshop, SLS 2007, Brussels, Belgium, September 6-8, 2007, Proceedings
Stochastic local search (SLS) algorithms enjoy great popularity as powerful and versatile tools for tackling computationally hard decision and optimization pr- lems from many areas of computer science, operations research, and engineering. However, in recent years it has become evident that at the core of this development task there is a highly complex engineering process, which combines various aspects of algorithm design with empirical analysis techniques and problem-specific background, and which relies heavily on knowledge from a number of disciplines and areas, including computer science, operations research, artificial intelligence, and statistics. This development process needs to be - sisted by a sound methodology that addresses the issues arising in the various phases of algorithm design, implementation, tuning, and experimental eval- tion.
Computers and Games ; 5th International Conference, CG 2006, Turin, Italy, May 29-31, 2006, Revised Papers
This book covers all aspects of artificial intelligence in computer-game playing. Topics addressed are evaluation and learning, search, combinatorial games and theory opening and endgame databases, single-agent search and planning, and computer Go.
Applied Parallel Computing ; State of the Art in Scientific Computing ; 8th International Workshop, PARA 2006, Umea, Sweden, June 18-21, 2006, Revised Selected Papers
It covers partial differential equations, parallel scientific computing algorithms, linear algebra, simulation environments, algorithms and applications for blue gene/L, scientific computing tools and applications, parallel search algorithms, peer-to-peer computing, mobility and security, algorithms for single-chip multiprocessors.
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.
