A theory of information and computation has been developed: " algo-rithmic information theory. " Two books [11–12] have recently been published on this subject, as well as a number of nontechnical discussions [13–16]. The main thrust of algorithmic information theory is twofold: (1) an information-theoretic mathematical definition of random sequence via algorithmic incompressibility, and (2) st...

When using methods for recovering the least squares optimal pose registration parameters between a model and an image suite construc tion of the feature correspondences is key In clusion of outliers in the correspondence set can severly deteriorate the performace and delity of these pose coregistration estimation algo rithms We consider the use of median lter ing in the construction of consiste...

This issue contains six papers that were presented in preliminary form at the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2005), held at Palma de Mallorca, Spain, October 7, 2005 in conjunction with ALGO 2005. These papers are representative of several areas of research within the scope of ATMOS: rolling stock circulation and engine assignment, station loc...

A novel curve segmentation algorithm for deter mining control points for deformable model based tar get tracking is proposed The algorithm is parameter less enabling a full edged automated tracking regard less of the shape of the object being tracked Compared with other curve segmentation algorithms it selects a minimal number of control points that yet deliver a superior shape description The ...

The main goal of this paper is to summarize the previous research on parallel genetic algo rithms We present an extension to previous categorizations of the parallelization techniques used in this eld We will use this categorization to guide us through a review of many of the most important publications We will build on this survey to try to identify some of the problems that have not been stud...

We have already seen some uses of randomization in the design of on line algorithms In these notes we shall describe other important illustrations of randomized algo rithms in other areas of the theory of algorithms For those interested in learning more about randomized algorithms we strongly recommend the forthcoming book by Motwani and Raghavan First we shall describe some basic principles wh...

This issue contains six papers that were presented in preliminary form at the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2005), held at Palma de Mallorca, Spain, October 7, 2005 in conjunction with ALGO 2005. These papers are representative of several areas of research within the scope of ATMOS: rolling stock circulation and engine assignment, station loc...

One big obstacle to understanding the nature of hierarchical task network (HTN) planning has been the lack of a dear theoretical framework. In particular, no one has yet presented a clear and concise HTN algorithm that is sound and complete. In this paper, we present a formal syntax and semantics for HTN planning. Based on this syntax and semantics, we are able to define an algo~thm for HTN pla...