2,136,172 Hits in 5.1 sec

An Hybrid Approach For Loss Reduction In Distribution Systems Using Harmony Search Algorithm

R. Srinivasa Rao
2010 Zenodo  
In this paper, an hybrid approach that combine network reconfiguration and capacitor placement using Harmony Search Algorithm (HSA) is proposed to minimize power loss reduction and improve voltage profile  ...  The proposed approach is tested on standard IEEE 33 and 16 bus systems.  ...  CONCLUSION In the paper, a new hybrid approach using Harmony Search Algorithm (HSA) is proposed for real power loss reduction and voltage profile improvement in the distribution system.  ... 
doi:10.5281/zenodo.1331114 fatcat:bams3kp5jbekzoqzfe4ji2fmiy

An incremental genetic algorithm approach to multiprocessor scheduling

A.S. Wu, H. Yu, S. Jin, K.-C. Lin, G. Schiavone
2004 IEEE Transactions on Parallel and Distributed Systems  
We have developed a genetic algorithm (GA) approach to the problem of task scheduling for multiprocessor systems.  ...  Key features of our system include a flexible, adaptive problem representation and an incremental fitness function.  ...  An algorithm that is able to adapt automatically to such changes can significantly improve the efficiency of managing a multiprocessor system.  ... 
doi:10.1109/tpds.2004.38 fatcat:obans5vuprbbhme4hbpo3papx4

Towards Optimized Distributed Multi-Robot Printing: An Algorithmic Approach [article]

Kedar Karpe, Avinash Sinha, Shreyas Raorane, Ayon Chatterjee, Pranav Srinivas, Lorenzo Sabattini
2021 arXiv   pre-print
This paper presents a distributed multi-robot printing method which utilizes an optimization approach to decompose and allocate a printing task to a group of mobile robots.  ...  The motivation for this problem is to minimize the printing time of the robots by using an appropriate task decomposition algorithm.  ...  Using some of these results, we contrast our distributed printing approach with another multi-robot printing system that uses evolutionary techniques to distribute the printing task among the robots.  ... 
arXiv:2102.12026v2 fatcat:qfr2a6jgbjhe7chejtwlecmtwa

An Approach on Semi-Distributed Load Balancing Algorithm for Cloud Computing System

Ajith Singh.N, M. Hemalatha
2012 International Journal of Computer Applications  
The data centre is built with lots of systems where balancing is not an easy task especially for cloud computing. Most of the research is done in distributed environments.  ...  By using the method of semidistributed load balancing we can design a new algorithm for the cloud computing.  ...  From the literature dynamic load balancing algorithm is applied either as distributed and non-distributed. The task of the load balancing is shared among the node in the distributed system.  ... 
doi:10.5120/8941-3083 fatcat:g7n3xtrtcvc2dccm2bdrfrlxxi

Flat Sampled Data Systems, an Algorithmic Approach [article]

Kurt Schlacher
2019 arXiv   pre-print
Flatness of sampled data systems can be characterized by a simple property.  ...  It is shown that this property follows from an integrability condition, which must be met by the flat parametrization.  ...  Extensions to exogenous presented in [1] , a more algorithmic approach can be found in [4] .  ... 
arXiv:1909.00555v1 fatcat:wfvbt5uv3rb35mt2xnuemstkmm

Simulation experiences with an ecological approach for pervasive service systems

Cynthia Villalba, Franco Zambonelli
2010 Proceeding of the 2nd workshop on Bio-inspired algorithms for distributed systems - BADS '10  
Also, an extensive set of simulation experiments are reported to outline the peculiarities of its dynamic behavior and to show the potential effectiveness of the approach.  ...  In particular, we focus on ecological systems that model and deploy services as autonomous individuals (i.e., agents), spatiallysituated in an ecosystem of other services, data sources, and pervasive devices  ...  Indeed, they too have been proposed to solve specific algorithmic problems in distributed network scenarios [3, 23] .  ... 
doi:10.1145/1809018.1809027 fatcat:av4ejfhpezflhkkiirpmhi53ua

Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach [article]

Guimu Guo, Da Yan, M. Tamer Özsu, Zhe Jiang, Jalal Khalil
2021 arXiv   pre-print
In this paper, we design parallel algorithms for mining maximal quasi-cliques on G-thinker, a recent distributed framework targeting divide-and-conquer graph mining algorithms that decomposes the mining  ...  While this system redesign applies to many other expensive dense subgraph mining problems, this paper verifies the idea by adapting the state-of-the-art quasi-clique algorithm, Quick, to our redesigned  ...  We adopt an algorithm-system codesign approach to parallelize quasi-clique mining, and the main contributions are as follows: • We redesigned G-thinker's execution engine to prioritize the execution of  ... 
arXiv:2005.00081v8 fatcat:zbim3i527jep5jt2alrfns6qba

An Approach Based on the Strength Pareto Evolutionary Algorithm 2 for Power Distribution System Planning [chapter]

Francisco Rivas-Dávalos, Malcolm R. Irving
2005 Lecture Notes in Computer Science  
This paper presents a new multi-objective planning method for power distribution systems. The method is based on the Strength Pareto Evolutionary Algorithm 2.  ...  The vast majority of the developed planning methods for power distribution systems consider only one objective function to optimize. This function represents the economical costs of the systems.  ...  Fig. 1 shows a power distribution system for planning. Fig. 1 . A power distribution system for planning.  ... 
doi:10.1007/978-3-540-31880-4_49 fatcat:ycm4eumj7rg7xp272ljvh2u5ae

Optimization and stabilization of networked control systems: An Estimation of Distribution Algorithm approach

HongBo Li, Mo-Yuen Chow, ZengQi Sun
2008 2008 47th IEEE Conference on Decision and Control  
Based on the obtained stability conditions, the corresponding controller design problem is solved, and Estimation of Distribution Algorithm (EDA) is used to select the optimal state feedback stabilizing  ...  Simulation results are given to demonstrate the effectiveness of the proposed approach.  ...  INTRODUCTION Networked control systems (NCSs) are spatially distributed control systems with the control loops closed over communication networks.  ... 
doi:10.1109/cdc.2008.4738695 dblp:conf/cdc/LiCS08 fatcat:playvyq2xfbrjef3qo7yxsbjzi

A Distributed, Asynchronous and Incremental Algorithm for Nonconvex Optimization: An ADMM Based Approach [article]

Mingyi Hong
2014 arXiv   pre-print
The proposed algorithm allows the problem to be solved in a distributed, asynchronous and incremental manner.  ...  Second, the algorithm can be viewed as implementing an incremental algorithm where at each step the (possibly delayed) gradients of only a subset of component functions are update d.  ...  We seek an algorithm that is capable of computing high quality solutions for problem (1) in a distributed, asynchronous and incremental manner.  ... 
arXiv:1412.6058v1 fatcat:nkby2wqda5bl5lekkau6tlxiwq

An Estimation-of-Distribution Algorithm Approach to Redundancy Allocation Problem for a High-Security System

Haydee Melo, Junzo Watada
2014 IEEJ Journal of Industry Applications  
This paper proposes an Estimation-of-Distribution Algorithm (EDA) approach as a new meta-heuristic method to solve a redundancy allocation problem (RAP) for a high security control system.  ...  A result of this growth in technology is an increase in the complexity and susceptibility of more complex systems.  ...  This new approach is called Estimation of distribution Algorithm (EDA).  ... 
doi:10.1541/ieejjia.3.358 fatcat:s6gvm7hecjakdawwvlw56a3nta

An Automata-Theoretic Approach to the Verification of Distributed Algorithms [article]

C. Aiswarya, Benedikt Bollig, Paul Gastin
2015 arXiv   pre-print
This is an appealing approach, as the number of rounds needed by a distributed algorithm to conclude is often exponentially smaller than the number of processes.  ...  We introduce an automata-theoretic method for the verification of distributed algorithms running on ring networks.  ...  Introduction Distributed algorithms are a classic discipline of computer science and continue to be an active field of research [13, 19] .  ... 
arXiv:1504.06534v1 fatcat:q3u6dp3or5a2rkbn6brelzfwqi

An algorithmic approach for fuzzy inference

C.J. Kim
1997 IEEE transactions on fuzzy systems  
This algorithmic approach alleviates many problems in the application of fuzzy logic to binary classification.  ...  This paper presents an algorithmic method for generating membership functions and fuzzy production rules; the method includes an entropy minimization for screening analog values.  ...  We propose to develop an algorithmic approach which, without human intervention, can be utilized universally for fuzzy logic applications in classification problem.  ... 
doi:10.1109/91.649911 fatcat:gw5yvqcymbe2jo3hees7ufzbpu

Overlap Local-SGD: An Algorithmic Approach to Hide Communication Delays in Distributed SGD [article]

Jianyu Wang, Hao Liang, Gauri Joshi
2020 arXiv   pre-print
In this paper, we propose an algorithmic approach named Overlap-Local-SGD (and its momentum variant) to overlap the communication and computation so as to speedup the distributed training procedure.  ...  However, the infrastructures variability such as high communication delay or random node slowdown greatly impedes the performance of distributed SGD algorithm, especially in a wireless system or sensor  ...  It is imperative to make distributed SGD to be fast as well as robust to the system variabilities.  ... 
arXiv:2002.09539v1 fatcat:wrz7dggcnjelnaxhawulb4453m

An approach for a distributed world model with QoS-based perception algorithm adaptation

Sebastian Blumenthal, Nico Hochgeschwender, Erwin Prassler, Holger Voos, Herman Bruyninckx
2015 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)  
This paper presents a distributed world model that is able to adapt to changes in the Quality of Service (QoS) of the communication layer by online reconfiguration of perception algorithms.  ...  The latter introduces a Level of Detail (LoD) metric based on a spatial resolution in order to infer an upper bound for the amount of data that can be transmitted without violating an application specific  ...  ACKNOWLEDGMENTS The authors acknowledge the support from the KU Leuven Geconcerteerde Onderzoeks-Acties Model based intelligent robot systems and Global real-time optimal control of autonomous robots and  ... 
doi:10.1109/iros.2015.7353612 dblp:conf/iros/BlumenthalHPVB15 fatcat:7nym7gchqng7jpvq62ul3u5uiq
« Previous Showing results 1 — 15 out of 2,136,172 results