The problem of defining robot behaviors to completely address a large and complex set of situations is very challenging. We present an approach for robot?s action selection in the robot soccer domain using Case-Based Reasoning techniques. A case represents a snapshot of the game at time t and the actions the robot should perform in that situation. We basically focus our work on the retrieval an...

We investigate the average number of moves made by Quick Select (a variant of Quick Sort for finding order statistics) to find an element with a randomly selected rank. This kind of grand average provides smoothing over all individual cases of a specific fixed order statistic. The variance of the number of moves involves intricate dependencies, and we only give reasonably tight bounds.

This paper presents a formal approach to the practical test selection problem that arises in conformance test laboratories when the question is which test cases from a given test suite should be executed. The existing standard ([1]), which provides a formal framework to conformance testing, does not deal with this aspect, although it is an important part of the test laboratories’ activity. Our ...

World has shrunk due to globalization of manufacturing trade and financing of such industrial activities. Thus this has increased tremendous competition across the nation. Obviously, the supply chain mechanism of quality products has to keep pace with the competition both qualitatively and quantitatively. Thus this has also catapulted knowledge based economy to new heights. In order to identify...

This paper presents an approach for the generation and selection of pronunciation transcriptions for a exible word recognizer. The basic idea is to produce pronunciation variants and corresponding scores with a set of pronunciation variation rules, which are weighted with their frequencies of occurence measured on the training data. This approach addresses the problem of interfering transcripti...

Given a sequence of n real numbers A = a1, a2, . . . , an and a positive integer k, the Sum Selection Problem is to find the segment A(i, j) = ai, ai+1, . . . , aj such that the rank of the sum s(i, j) = j t=i at is k over all n(n−1) 2 segments. We present a deterministic algorithm for this problem that runs in O(n log n) time. The previously best known randomized algorithm for this problem run...

In this work we present a probabilistic analysis of the Floyd-Rivest expected time selection algorithm. In particular we show that a refinement of the bootstrapped version of the FloydRivest algorithm that determines the C-th order statistic by performing an expected n + C + O(n) number of comparisons can be made into a randomized algorithm that performs n + C +O(n log n) comparisons with proba...

Regression test selection techniques attempt to reduce the cost of regression testing by selecting a subset of an existing test suite for execution on a modiied program. Over the past two decades, numerous regression test selection techniques have been described in the literature. Initial empirical studies of a few of these techniques have shown that they can be beneecial, but the studies were ...

In this paper we consider the robust portfolio selection problem involving two types of uncertainties; the uncertainty in the distribution of exit time and the uncertainty in the distribution of portfolio return conditional on exit time. To deal with these uncertainties, we propose a tractable approach by applying worst-case VaR strategy to the case where partial information on the exit time di...

An expected six-week court case, due to conclude next month, pits US biologists' commitment to the evolutionary theories of Darwin once again against religious opponents with more biblical views. In a Pennsylvania courtroom a test case could decide how evolution is taught in state schools. The civil trial, triggered last year by a classroom battle, marks the beginning of the first major legal a...