a generalization of the known results in fusion frames and $g$-frames theory to continuous fusion frames which defined by m. h. faroughi and r. ahmadi, is presented in this study. continuous resolution of the identity (cri) is introduced, a new family of cri is constructed, and a number of reconstruction formulas are obtained. also, new results are given on the duality of continuous fusion fram...

In order to overcome prematurity of ant colony algorithm, the conception of belief space originated in cultural algorithm is introduced, and a new cultural ant algorithm is proposed for continuous optimization problems. Firstly, the coding scheme for ant colony algorithm to solve continuous optimization problems is discussed. Then belief space is brought in, and designed as the form of two part...

We study a fine hierarchy of Borel-piecewise continuous functions, especially, between closed-piecewise continuity and Gδ-piecewise continuity. Our aim is to understand how a priority argument in computability theory is connected to the notion of Gδ-piecewise continuity, and then we utilize this connection to obtain separation results on subclasses of Gδ-piecewise continuous reductions for unif...

In metaheuristic optimization, understanding the relationship between problems and algorithms is important but non-trivial. There has been a growing interest in the literature on techniques for analysing problems, however previous work has mainly been developed for discrete problems. In this paper, we develop a novel framework for characterising continuous optimization problems based on the con...

The problem of positioning p points so as to maximize the minimum distance between them has been studied in both location theory (as the continuous p-dispersion problem) and the design of computer experiments (as the maximin distance design problem). This problem can be formulated as a nonlinear program, either exactly or approximately. We consider formulations of both types and demonstrate tha...

Many scientific computing algorithms (in various domains, such as weather prediction, structural analysis, or electrical network analysis) strongly rely on solving fundamental matrix computation problems (such as linear system solving, eigenvalue decomposition, singular value decomposition, matrix nearness problems, joint diagonalization of matrices...). These problems are often solved using it...

From 23.09.12 to 28.09.12, the Dagstuhl Seminar 12391 Algorithms and Complexity for Continuous Problems was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar can be found in this report. The...

This paper is concerned with the problem of Reinforcement Learning (RL) for continuous state space and time stocha.stic control problems. We state the Harnilton-Jacobi-Bellman equation satisfied by the value function and use a Finite-Difference method for designing a convergent approximation scheme. Then we propose a RL algorithm based on this scheme and prove its convergence to the optimal sol...

Tomography using CT scans and MRI scans is now well-known as a medical diagnostic tool which allows for detection of tumors and other abnormalities in a noninvasive way, providing very detailed images of the inside of the body using low dosage X-rays and magnetic fields. They have both also been used for determination of material defects in moderate size objects. In medical and other applicatio...

s of Talks (in alphabetical order by speaker’s surname) Probabilistic Analysis of Interior Point Methods for Linear Programming Karl Heinz Borgwardt joint work with Petra Huhn It is our aim to make a fair comparison of the Simplex Method and Interior Point Methods on the basis of their average case behavior in the solution of Linear Programming problems possible. Therefore we use the same stoch...