All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 22 Next

Displaying 421 – 440 of 922

Showing per page

A Space Lower Bound for Acceptance by One-Way Π2-Alternating Machines

Viliam Geffert, Norbert Popély (2010)

RAIRO - Theoretical Informatics and Applications

We show that one-way Π2-alternating Turing machines cannot accept unary nonregular languages in o(log n) space. This holds for an accept mode of space complexity measure, defined as the worst cost of any accepting computation. This lower bound should be compared with the corresponding bound for one-way Σ2-alternating machines, that are able to accept unary nonregular languages in space O(log log n). Thus, Σ2-alternation is more powerful than Π2-alternation for space bounded one-way machines with...

A sparse dynamic programming algorithm for alignment with non-overlapping inversions

Alair Pereira Do Lago, Ilya Muchnik, Casimir Kulikowski (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Alignment of sequences is widely used for biological sequence comparisons, and only biological events like mutations, insertions and deletions are considered. Other biological events like inversions are not automatically detected by the usual alignment algorithms, thus some alternative approaches have been tried in order to include inversions or other kinds of rearrangements. Despite many important results in the last decade, the complexity of the problem of alignment with inversions is still unknown....

A sparse dynamic programming algorithm for alignment with non-overlapping inversions

Alair Pereira do Lago, Ilya Muchnik, Casimir Kulikowski (2010)

RAIRO - Theoretical Informatics and Applications

Alignment of sequences is widely used for biological sequence comparisons, and only biological events like mutations, insertions and deletions are considered. Other biological events like inversions are not automatically detected by the usual alignment algorithms, thus some alternative approaches have been tried in order to include inversions or other kinds of rearrangements. Despite many important results in the last decade, the complexity of the problem of alignment with inversions is...

A stochastic mirror-descent algorithm for solving A X B = C over an multi-agent system

Yinghui Wang, Songsong Cheng (2021)

Kybernetika

In this paper, we consider a distributed stochastic computation of A X B = C with local set constraints over an multi-agent system, where each agent over the network only knows a few rows or columns of matrixes. Through formulating an equivalent distributed optimization problem for seeking least-squares solutions of A X B = C , we propose a distributed stochastic mirror-descent algorithm for solving the equivalent distributed problem. Then, we provide the sublinear convergence of the proposed algorithm. Moreover,...

A strategy learning model for autonomous agents based on classification

Bartłomiej Śnieżyński (2015)

International Journal of Applied Mathematics and Computer Science

In this paper we propose a strategy learning model for autonomous agents based on classification. In the literature, the most commonly used learning method in agent-based systems is reinforcement learning. In our opinion, classification can be considered a good alternative. This type of supervised learning can be used to generate a classifier that allows the agent to choose an appropriate action for execution. Experimental results show that this model can be successfully applied for strategy generation...

A survey of methods to evaluate quantified sentences.

Miguel Delgado, Daniel Sánchez, José María Serrano, M. Amparo Vila (2000)

Mathware and Soft Computing

The evaluation of quantified sentences is used to solve several problems. Most of the methods proposed in the literature are not satisfactory because they do not verify some intuitive properties. In this paper we propose an extension of both possibilistic and probabilistic methods, based on the Sugeno and the Choquet fuzzy integrals respectively, for the evaluation of type II sentences, the most general kind of sentences. These methods verify good properties, and they are shown to be better than...

A survey of subpixel edge detection methods for images of heat-emitting metal specimens

Anna Fabijańska (2012)

International Journal of Applied Mathematics and Computer Science

In this paper the problem of accurate edge detection in images of heat-emitting specimens of metals is discussed. The images are provided by the computerized system for high temperature measurements of surface properties of metals and alloys. Subpixel edge detection is applied in the system considered in order to improve the accuracy of surface tension determination. A reconstructive method for subpixel edge detection is introduced. The method uses a Gaussian function in order to reconstruct the...

A survey on combinatorial optimization in dynamic environments∗

Nicolas Boria, Vangelis T. Paschos (2011)

RAIRO - Operations Research

This survey presents major results and issues related to the study of NPO problems in dynamic environments, that is, in settings where instances are allowed to undergo some modifications over time. In particular, the survey focuses on two complementary frameworks. The first one is the reoptimization framework, where an instance I that is already solved undergoes some local perturbation. The goal is then to make use of the information provided by the initial solution to compute a new solution. The...

A survey on combinatorial optimization in dynamic environments∗

Nicolas Boria, Vangelis T. Paschos (2011)

RAIRO - Operations Research

This survey presents major results and issues related to the study of NPO problems in dynamic environments, that is, in settings where instances are allowed to undergo some modifications over time. In particular, the survey focuses on two complementary frameworks. The first one is the reoptimization framework, where an instance I that is already solved undergoes some local perturbation. The goal is then to make use of the information provided by the initial solution to compute a new solution. The...

Currently displaying 421 – 440 of 922