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

Displaying 21 – 40 of 56

Showing per page

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,...

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...

Agent-oriented abstraction.

Jacques Calmet, Pierre Maret, Regine Endsuleit (2004)

RACSAM

We define an agent-oriented abstraction formalism devoted to generalized theories of abstraction that have been proposed in Artificial Intelligence. The model we propose extends the abstraction capabilities of the existing Agent-Oriented Programming paradigm. This short note reviews first the existing attempts to define abstraction in AI and in agent systems. Then, our model is introduced in terms of six definitions covering the concepts of agents, annotated knowledge, utility and society of agents....

Algorithmic Background of the Host Recommendation in the Adaptive Distributed Multimedia Server

Szkaliczki, Tibor, Goldschmidt, Balázs, Böszörmenyi, Laszlo (2007)

Serdica Journal of Computing

Partial support of the Hungarian State Eötvös Scholarship, the Hungarian National Science Fund (Grant No. OTKA 42559 and 42706) and the Mobile Innovation Center, Hungary is gratefully acknowledged.In a distributed server architecture an obvious question is where to deploy the components. Host recommendation, which gives the answer, faces problems such as server selection, host deployment and, in case of multimedia servers, video replication. It is especially relevant for the Adaptive Distributed...

An approach based on the use of the ant system to design combinational logic circuits.

Benito Mendoza García, Carlos A. Coello Coello (2002)

Mathware and Soft Computing

In this paper we report the first attempt to design combinational logic circuits using the ant system. In order to design circuits, a measure of quality improvement in partially built circuits is introduced and a cost metric (based on the number of gates) is adopted in order to optimize the feasible circuits generated. The approach is compared to a genetic algorithm and to a human designer using several examples and the sensitivity of the algorithm to its parameters is studied using analysis of...

An Exact Method for Solving the Multi-Processor Flow-Shop

Jacques Carlier, Emmanuel Neron (2010)

RAIRO - Operations Research

The aim of this paper is to present a new branch and bound method for solving the Multi-Processor Flow-Shop. This method is based on the relaxation of the initial problem to m-machine problems corresponding to centers. Release dates and tails are associated with operations and machines. The branching scheme consists in fixing the inputs of a critical center and the lower bounds are those of the m-machine problem. Several techniques for adjusting release dates and tails have also been introduced....

An improved ant algorithm for Multi-mode Resource Constrained Project Scheduling Problem

Peng Wuliang, Huang Min, Hao Yongping (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Many real-world scheduling problems can be modeled as Multi-mode Resource Constrained Project Scheduling Problems (MRCPSP). However, the MRCPSP is a strong NP-hard problem and very difficult to be solved. The purpose of this research is to investigate a more efficient alternative based on ant algorithm to solve MRCPSP. To enhance the generality along with efficiency of the algorithm, the rule pool is designed to manage numerous priority rules for MRCPSP. Each ant is provided with an independent...

An SMDP model for a multiclass multi-server queueing control problem considering conversion times

Zhicong Zhang, Na Li, Shuai Li, Xiaohui Yan, Jianwen Guo (2014)

RAIRO - Operations Research - Recherche Opérationnelle

We address a queueing control problem considering service times and conversion times following normal distributions. We formulate the multi-server queueing control problem by constructing a semi-Markov decision process (SMDP) model. The mechanism of state transitions is developed through mathematical derivation of the transition probabilities and transition times. We also study the property of the queueing control system and show that optimizing the objective function of the addressed queueing control...

Currently displaying 21 – 40 of 56