Displaying 501 – 520 of 925

Showing per page

Access structures for finding characteristic-dependent linear rank inequalities

Victor Peña-Macias (2023)

Kybernetika

Determining information ratios of access structures is an important problem in secret sharing. Information inequalities and linear rank inequalities play an important role for proving bounds on these ratios. Characteristic-dependent linear rank inequalities are rank inequalities which are true over vector spaces with specific field characteristic. In this paper, using ideas of secret sharing, we show a theorem that produces characteristic-dependent linear rank inequalities. These inequalities are...

Accurate and online-efficient evaluation of the a posteriori error bound in the reduced basis method

Fabien Casenave, Alexandre Ern, Tony Lelièvre (2014)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

The reduced basis method is a model reduction technique yielding substantial savings of computational time when a solution to a parametrized equation has to be computed for many values of the parameter. Certification of the approximation is possible by means of an a posteriori error bound. Under appropriate assumptions, this error bound is computed with an algorithm of complexity independent of the size of the full problem. In practice, the evaluation of the error bound can become very sensitive...

Adaptive control of cluster-based Web systems using neuro-fuzzy models

Krzysztof Zatwarnicki (2012)

International Journal of Applied Mathematics and Computer Science

A significant development of Web technologies requires the application of more and more complex systems and algorithms for maintaining high quality of Web services. Presently, not only simple decision-making tools but also complex adaptation algorithms using artificial intelligence techniques are applied for controlling HTTP request traffic. The paper presents a new LFNRD (Local Fuzzy-Neural Adaptive Request Distribution) algorithm for request distribution in cluster-based Web systems using neuro-fuzzy...

Adaptive search heuristics for the generalized assignment problem.

Helena Ramalhinho Lourenço, Daniel Serra (2002)

Mathware and Soft Computing

The Generalized Assignment Problem consists of assigning a set of tasks to a set of agents at minimum cost. Each agent has a limited amount of a single resource and each task must be assigned to one and only one agent, requiring a certain amount of the agent's resource. We present the application of a MAX-MIN Ant System (MMAS) and a greedy randomized adaptive search procedure (GRASP) to the generalized assignment problem based on hybrid approaches. The MMAS heuristic can be seen as an adaptive sampling...

Adhesive and quasiadhesive categories

Stephen Lack, Paweł Sobociński (2005)

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

We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories which restrict attention to regular monomorphisms. Many examples of graphical structures used in computer science are shown to be examples of adhesive and quasiadhesive categories. Double-pushout graph rewriting generalizes well to rewriting on arbitrary adhesive and quasiadhesive categories.

Adhesive and quasiadhesive categories

Stephen Lack, Paweł Sobociński (2010)

RAIRO - Theoretical Informatics and Applications

We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories which restrict attention to regular monomorphisms. Many examples of graphical structures used in computer science are shown to be examples of adhesive and quasiadhesive categories. Double-pushout graph rewriting generalizes well to rewriting on arbitrary adhesive and quasiadhesive categories.

Advanced approach for the public transportation regulation system based on cybercars

Asma Melki, Slim Hammadi, Yves Sallez, Thierry Berger, Christian Tahon (2010)

RAIRO - Operations Research

In the last decade, the authorities require the use of safe, comfortable vehicles to assure a door to door aspect with respect of environment in the urban context. In this paper, we propose an advanced approach of transport regulation where we integrate cybercars into a regulation process as an alternative in disruption cases. For that, we propose an ITS architecture including public transportation and cybercars into the same framework. We will show that collaboration between these two systems...

Advice Complexity and Barely Random Algorithms

Dennis Komm, Richard Královič (2011)

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

Recently, a new measurement – the advice complexity – was introduced for measuring the information content of online problems. The aim is to measure the bitwise information that online algorithms lack, causing them to perform worse than offline algorithms. Among a large number of problems, a well-known scheduling problem, job shop scheduling with unit length tasks, and the paging problem were analyzed within this model. We observe some connections between advice complexity and randomization. Our...

Advice Complexity and Barely Random Algorithms

Dennis Komm, Richard Královič (2011)

RAIRO - Theoretical Informatics and Applications

Recently, a new measurement – the advice complexity – was introduced for measuring the information content of online problems. The aim is to measure the bitwise information that online algorithms lack, causing them to perform worse than offline algorithms. Among a large number of problems, a well-known scheduling problem, job shop scheduling with unit length tasks, and the paging problem were analyzed within this model. We observe some connections between advice complexity and randomization....

Currently displaying 501 – 520 of 925