Accurate computation of the relative entropy between stochastic regular grammars
ACS-TS: Train scheduling using ant colony system.
Acyclic, star and oriented colourings of graph subdivisions.
Adaptive bifurcation routing algorithms for computer-communication networks
Adaptive constraint reduction for training support vector machines.
Adaptive control of cluster-based Web systems using neuro-fuzzy models
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 control of system entropy
Adaptive filters for color image processing.
Adaptive search heuristics for the generalized assignment problem.
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...
Addition molle et fonctions p-locales.
Addressing the stochastic nature of scientific computations via dynamic loop scheduling.
Adhesive and quasiadhesive categories
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
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.
Adjunction models for call-by-push-value with stacks.
Advanced approach for the public transportation regulation system based on cybercars
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...
Advanced inference in fuzzy systems by rule base compression.
Advice Complexity and Barely Random Algorithms
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
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....
Affine Parikh automata∗
The Parikh finite word automaton (PA) was introduced and studied in 2003 by Klaedtke and Rueß. Natural variants of the PA arise from viewing a PA equivalently as an automaton that keeps a count of its transitions and semilinearly constrains their numbers. Here we adopt this view and define the affine PA, that extends the PA by having each transition induce an affine transformation on the PA registers, and the PA on letters, that restricts the PA...
Affine Parikh automata
The Parikh finite word automaton (PA) was introduced and studied in 2003 by Klaedtke and Rueß. Natural variants of the PA arise from viewing a PA equivalently as an automaton that keeps a count of its transitions and semilinearly constrains their numbers. Here we adopt this view and define the affine PA, that extends the PA by having each transition induce an affine transformation on the PA registers, and the PA on letters, that restricts the PA by forcing any two transitions on the same letter...