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 80 Next

Displaying 1581 – 1600 of 4973

Showing per page

Distance desert automata and the star height problem

Daniel Kirsten (2005)

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

We introduce the notion of nested distance desert automata as a joint generalization of distance automata and desert automata. We show that limitedness of nested distance desert automata is PSPACE-complete. As an application, we show that it is decidable in 2 2 𝒪 ( n ) space whether the language accepted by an n -state non-deterministic automaton is of a star height less than a given integer h (concerning rational expressions with union, concatenation and iteration), which is the first ever complexity bound...

Distance desert automata and the star height problem

Daniel Kirsten (2010)

RAIRO - Theoretical Informatics and Applications

We introduce the notion of nested distance desert automata as a joint generalization of distance automata and desert automata. We show that limitedness of nested distance desert automata is PSPACE-complete. As an application, we show that it is decidable in 22O(n) space whether the language accepted by an n-state non-deterministic automaton is of a star height less than a given integer h (concerning rational expressions with union, concatenation and iteration), which is the first ever complexity...

Distributed aggregative optimization with quantized communication

Ziqin Chen, Shu Liang (2022)

Kybernetika

In this paper, we focus on an aggregative optimization problem under the communication bottleneck. The aggregative optimization is to minimize the sum of local cost functions. Each cost function depends on not only local state variables but also the sum of functions of global state variables. The goal is to solve the aggregative optimization problem through distributed computation and local efficient communication over a network of agents without a central coordinator. Using the variable tracking...

Distributed classification learning based on nonlinear vector support machines for switching networks

Yinghui Wang, Peng Lin, Huashu Qin (2017)

Kybernetika

In this paper, we discuss the distributed design for binary classification based on the nonlinear support vector machine in a time-varying multi-agent network when the training data sets are distributedly located and unavailable to all agents. In particular, the aim is to find a global large margin classifier and then enable each agent to classify any new input data into one of the two labels in the binary classification without sharing its all local data with other agents. We formulate the support...

Distributed dual averaging algorithm for multi-agent optimization with coupled constraints

Zhipeng Tu, Shu Liang (2024)

Kybernetika

This paper investigates a distributed algorithm for the multi-agent constrained optimization problem, which is to minimize a global objective function formed by a sum of local convex (possibly nonsmooth) functions under both coupled inequality and affine equality constraints. By introducing auxiliary variables, we decouple the constraints and transform the multi-agent optimization problem into a variational inequality problem with a set-valued monotone mapping. We propose a distributed dual averaging...

Distributed fuzzy decision making for production scheduling.

Thomas A. Runkler, Rudolf Sollacher, Wendelin Reverey (2004)

Mathware and Soft Computing

In production systems, input materials (educts) pass through multiple sequential stages until they become a product. The production stages consist of different machines with various dynamic characteristics. The coupling of those machines is a non-linear distributed system. With a distributed control system based on a multi-agent approach, the production system can achieve (almost) maximum output, where lot size and lot sequence are the most important control variables. In most production processes...

Distributed Nash equilibrium tracking via the alternating direction method of multipliers

Ji Ma, Zheng Yang, Ziqin Chen (2023)

Kybernetika

Nash equilibrium is recognized as an important solution concept in non-cooperative game theory due to its broad applicability to economics, social sciences, computer science, and engineering. In view of its importance, substantial progress has been made to seek a static Nash equilibrium using distributed methods. However, these approaches are inapplicable in dynamic environments because, in this setting, the Nash equilibrium constantly changes over time. In this paper, we propose a dynamic algorithm...

Distributed objects for parallel numerical applications

Francoise Baude, Denis Caromel, David Sagnol (2002)

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

The C++// language (pronounced C++ parallel) was designed and implemented with the aim of importing reusability into parallel and concurrent programming, in the framework of a mimd model. From a reduced set of rather simple primitives, comprehensive and versatile libraries are defined. In the absence of any syntactical extension, the C++// user writes standard C++ code. The libraries are themselves extensible by the final users, making C++// an open system. Two specific techniques to improve performances...

Distributed Objects for Parallel Numerical Applications

Francoise Baude, Denis Caromel, David Sagnol (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

The C++// language (pronounced C++parallel) was designed and implemented with the aim of importing reusability into parallel and concurrent programming, in the framework of a mimd model. From a reduced set of rather simple primitives, comprehensive and versatile libraries are defined. In the absence of any syntactical extension, the C++// user writes standard C++ code. The libraries are themselves extensible by the final users, making C++// an open system. Two specific techniques to improve performances...

Distributed optimization for multi-agent system over unbalanced graphs with linear convergence rate

Songsong Cheng, Shu Liang (2020)

Kybernetika

Distributed optimization over unbalanced graphs is an important problem in multi-agent systems. Most of literatures, by introducing some auxiliary variables, utilize the Push-Sum scheme to handle the widespread unbalance graph with row or column stochastic matrix only. But the introduced auxiliary dynamics bring more calculation and communication tasks. In this paper, based on the in-degree and out-degree information of each agent, we propose an innovative distributed optimization algorithm to reduce...

Distributed optimization via active disturbance rejection control: A nabla fractional design

Yikun Zeng, Yiheng Wei, Shuaiyu Zhou, Dongdong Yue (2024)

Kybernetika

This paper studies distributed optimization problems of a class of agents with fractional order dynamics and unknown external disturbances. Motivated by the celebrated active disturbance rejection control (ADRC) method, a fractional order extended state observer (Frac-ESO) is first constructed, and an ADRC-based PI-like protocol is then proposed for the target distributed optimization problem. It is rigorously shown that the decision variables of the agents reach a domain of the optimal solution...

Division in logspace-uniform NC 1

Andrew Chiu, George Davida, Bruce Litow (2001)

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

Beame, Cook and Hoover were the first to exhibit a log-depth, polynomial size circuit family for integer division. However, the family was not logspace-uniform. In this paper we describe log-depth, polynomial size, logspace-uniform, i.e., NC 1 circuit family for integer division. In particular, by a well-known result this shows that division is in logspace. We also refine the method of the paper to show that division is in dlogtime-uniform NC 1 .

Division in logspace-uniform NC1

Andrew Chiu, George Davida, Bruce Litow (2010)

RAIRO - Theoretical Informatics and Applications

Beame, Cook and Hoover were the first to exhibit a log-depth, polynomial size circuit family for integer division. However, the family was not logspace-uniform. In this paper we describe log-depth, polynomial size, logspace-uniform, i.e., NC1 circuit family for integer division. In particular, by a well-known result this shows that division is in logspace. We also refine the method of the paper to show that division is in dlogtime-uniform NC1.

DML-CZ Metadata Editor

Bartošek, Miroslav, Kovář, Petr, Šárfy, Martin (2008)

Towards Digital Mathematics Library. Birmingham, United Kingdom, July 27th, 2008

The aim of the DML-CZ project (2005–2009 — Czech Academy of Sciences, Masaryk University in Brno, Charles University in Prague, Czech Republic) is to investigate, develop and apply techniques, methods and tools that would allow the creation of the Czech Digital Mathematics Library. The most important tool developed and used in the course of the project is the Metadata Editor — a complex web-based system supporting all essential steps in the development of the article oriented digital library: integration...

Currently displaying 1581 – 1600 of 4973