Several frameworks exist to describe how procedural content can be understood, or how it can be used in games. In this paper, we present a framework that considers generativity as a pipeline of successive data transformations, with each transformation either generating, transforming, or pruning away information. This framework has been iterated through repeated engagement and education interact...

A deterministic global optimization algorithm is introduced for locating global mInlmUm potential energy molecular conformations. The proposed branch and bound type algorithm attains finite €-convergence to the global minimum through the successive refinement of converging lower and upper bounds on the solution. These bounds are obtained through a novel convex lowering bounding of the total pot...

This paper proposes a novel monocular SLAM approach. For a triplet of successive keyframes, the approach inteleaves the registration of the three 3D maps associated to each image pair in the triplet and the refinement of the corresponding poses, by progressively limiting the allowable reprojection error according to a simulated annealing scheme. This approach computes only local overlapping map...

In this project report, we present three practical schemes of lossy compression for Laplacian source and L-1 distortion: The first scheme generalizes the successive refinement scheme. The second scheme modifies the first scheme by using only ternary alphabet. The third scheme encodes only the indices of maximum and minimum component. The whole of suggested schemes have a rateless property as we...

This paper presents a formal method for requirements specification and analysis. Using this method some techniques for step-wise refinement are studied. During the early phases of system development, where the exact requirements are yet unclear, these techniques allow to write incomplete and global specifications, which during successive steps can be refined and completed. At each step the meth...

This article is concerned with the numerical solution of convex variational problems. More precisely, we develop an iterative minimisation technique which allows for the successive enrichment of an underlying discrete approximation space in an adaptive manner. Specifically, we outline a new approach in the context of hp–adaptive finite element methods employed for the efficient numerical soluti...

While UML gives an intuitive image of the system, formal methods provide the proof of its correctness. We can benefit from both aspects by combining UML and formal methods. Even for the combined method we need consistent and compact description of the changes made during the system development. In the development process certain design patterns can be applied. In this paper we introduce progres...

How small can a stationary iterative method for solving a linear system Ax = b make the error and the residual in the presence of rounding errors? We give a componentwise error analysis that provides an answer to this question and we examine the implications for numerical stability. The Jacobi, Gauss-Seidel and successive overrelaxation methods are all found to be forward stable in a componentw...

This paper presents a demonstration case on the successive application of a model-based technique to assist on the refinement of software logical architectures. The technique is essentially based on the transformation of use cases into object diagrams. The applicability of the technique is illustrated by presenting some results from a mobile application. For mobile software, the definition of t...

While navigation could be done using existing rule-based approaches, it becomes more attractive to use learning from demonstration (LfD) approaches to ease the burden of tedious rule designing and parameter tuning procedures. In our previous work, navigation in simple dynamic environments is achieved using the Learning to Search (LEARCH) algorithm with a proper feature set and the proposed data...