We examine neighborhood structures for heuristic search applicable to a general class of vehicle routing problems (VRPs). Our methodology utilizes a cyclic-order solution encoding, which maps a permutation of the customer set to a collection of many possible VRP solutions. We identify the best VRP solution in this collection via a polynomial-time algorithm from the literature. We design neighbo...

As Topic Maps allow a structural representation of knowledge, this structure often needs to be visually presented to end-users. Issues, often contradictory, such as representation and navigation re-

In this contribution, we address exploratory search where a user is faced with an information need concerning a domain he lacks specific knowledge. Based on the work of Delbru et al., which introduced metrics to measure the navigational quality of automatically selected facets for RDF data, we apply those findings to the semantically richer TMDM and show how exploratory search functionality can...

We discuss the spectral curves and rational maps associated with SU(2) Bogomolny monopoles of arbitrary charge k. We describe the effect on the rational maps of inverting monopoles in the plane with respect to which the rational maps are defined, and discuss the monopoles invariant under such inversion. We define the strongly centred monopoles, and show they form a geodesic submanifold of the k...

In this paper, first steps are taken towards characterizing rank-decorated lattices of cyclic flats Z(M) that belong to matroids M can be represented over a prescribed finite field Fq. Two natural maps from the lattice minor given. Binary characterized via their flats. It is shown simple binary matroid without isthmuses atomic.

Many colour maps provided by vendors have highly uneven perceptual contrast over their range. It is not uncommon for colour maps to have perceptual flat spots that can hide a feature as large as one tenth of the total data range. Colour maps may also have perceptual discontinuities that induce the appearance of false features. Previous work in the design of perceptually uniform colour maps has ...

In this paper, we introduce the concept of contractive pair maps and give some necessary sufficient conditions for existence uniqueness best proximity points such pairs. our approach, have been weakened. An application has presented to demonstrate usability results. Also, cyclic ?-contraction asymptotic convergence theorems on point mappings. The results extend, generalize improve known from th...

Requirements of reactive systems are usually specified by classifying system executions as desirable and undesirable. To specify prioritized requirements, we propose to associate a rank with each execution. This leads to optimization analogs of verification and synthesis problems in which we compute the "best" requirement that can be satisfied or enforced from a given state. The classical defin...