. We report on a case study to assess the use of an advanced knowledge-based software design technique with programmers who have not participated in the technique's development. We use the KIDS approach to algorithm design to construct two global search algorithms that route baggage through a

We report on a case study to assess the use of an advanced knowledge-based software design technique to programmers who have not participated in the technique 's development. We use the KIDS approach to algorithm design to construct two global search algorithms that route baggage through a

Abstract: We use a formalization of the meta-theory of program development to derive a verifiably correct strategy constructing well-structured global search algorithms from specifications. The derivation formalizes and strengthens an algorithm design strategy used in the KIDS system and shows how

Abstract The n-dimensional direct search algorithm DIRECT of Jones, Perttunen, and Stuckman has attracted recent attention from the multidisciplinary design optimization community. Since DIRECT only requires function values (or ranking) and balances global exploration with local refinement better

The global search properties of heuristic search algorithms are not well understood. In this paper, we introduce a new metric, mobility, that quantifies the dispersion of local optima visited during a search. This allows us to explore two questions: How disperse are the local optima visited during

Algorithm synthesis transforms a formal specification into an efficient algorithm to solve a problem. Algorithm synthesis in Specware combines the formal speicifcation of a problem with a highlevel algorithm strategy. To derive an efficient algorithm, a developer must define operators that refine

This paper is made available online in accordance with publisher policies. Please scroll down to view the document itself. Please refer to the repository record for this item and our policy information available from the repository home page for further information. To see the final version of this paper please visit the publisher’s website. Access to the published version may require a subscription.

search algorithm based Multiuser detectors.

In this paper we describe the formal derivation of a transportation scheduling algorithm. The algorithm is based on the concepts of global search and constraint propagation and was originally derived using Kids (Kestrel Interactive Development System). The emphasis in this paper is on clarity

interesting for the evolutionary computation community: systematic sampling of the search space (DIRECT, MCS) possibly combined with a local search method (MCS), or a multistart approach (NEWUOA, GLOBAL) possibly equipped with a careful selection of points to run a local optimizer from (GLOBAL). The recently