Varol Akman – författare

Presents algebraic and geometric algorithms to deal with a specific problem, which frequently occurs in model-based robotics systems and is of utmost importance in calibrating the complexity of robotics tasks in general. The algorithms are based on several ideas from areas such as elimination theory, optimization, polyhedral theory and Voronoi diagrams. The algorithms were also implemented in a Lisp in a workbench to allow experimentation with shortest path problems.

This book constitutes the reviewed proceedings of the Third International Conference on Modeling and Using Context, CONTEXT 2001, held in Dundee, UK in July 2001. The 30 full papers and 15 short papers presented were carefully reviewed, selected, and revised for inclusion in the proceedings. The papers presented deal with the interdisciplinary topic of modeling and using contextual information from various points of view, ranging through cognitive science, formal logic, artificial intelligence and information processing. Highly general philosophical and logical theories are complemented by specific applications in a variety of fields.