Filters








5,719 Hits in 7.6 sec

Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem

S. Mehdi Vahidipour, Mohammad Reza Meybodi, Mehdi Esnaashari
2017 Discrete event dynamic systems  
The proposed CAPN-LA is then used to design different algorithms for the classic problem of vertex coloring.  ...  Using APN-LA, one may be able to design adaptive algorithms to solve problems. There are problems for which designing a single APN-LA is a tedious work and results in a large and complex model.  ...  There are a number of algorithms for the problem of vertex coloring in which complex models are used based on LA.  ... 
doi:10.1007/s10626-017-0251-z fatcat:7vecsd6opnajxm5rkeoilpfpxy

Base station cluster patterns for semi-static multi-cell cooperation in irregular network topologies

Jeonghun Park, Namyoon Lee, Robert W. Heath
2015 2015 23rd European Signal Processing Conference (EUSIPCO)  
Each of the formed BS clusters is mapped into a particular cluster pattern by exploiting the edge-coloring in graph theory.  ...  This paper proposes a clustering strategy for semi-static multicell cooperation.  ...  Acknowledgement This research was supported by a gift from Huawei Technologies Co. Ltd.  ... 
doi:10.1109/eusipco.2015.7362823 dblp:conf/eusipco/ParkLH15 fatcat:w6xvlty5s5dwxnvw63ra4pz5yu

An Improved Centralized Cognitive Radio Network Spectrum Allocation Algorithm Based on the Allocation Sequence

Jianli Zhao, Jinsha Yuan
2013 International Journal of Distributed Sensor Networks  
In order to avoid the interference, a mathematical model of spectrum allocation for cognitive radio spectrum allocation algorithm is established through a graph theory.  ...  The spectrum allocation algorithms with different allocation objectives based on graph theory are studied according to the different network structures.  ...  This requires the undirected graph edge at one end add to an arrow from a vertex point to another vertex.  ... 
doi:10.1155/2013/875342 fatcat:2z6gowwatrdgzb7xthebdyd4qe

Graph-Based Joint User-Centric Overlapped Clustering and Resource Allocation in Ultradense Networks

Yan Lin, Rong Zhang, Chunguo Li, Luxi Yang, Lajos Hanzo
2018 IEEE Transactions on Vehicular Technology  
Then, based on the overlapped clusters constructed, we propose a novel two-stage graph-based user-centric resource allocation scheme for mitigating the resultant inter-cluster interference, despite the  ...  a promising design principle for guaranteeing the quality of service (QoS) required by each UE.  ...  An example of a graph model based on Fig. 2(a) is given in Fig. 2(b) , where the graph consists of 15 edges and 8 vertices associated with 4 colors. A.  ... 
doi:10.1109/tvt.2017.2787802 fatcat:uefrgzql5na75cxpqcgg7g7swe

An aspect-oriented approach for modeling self-organizing emergent structures

Linda M. Seiter, Daniel W. Palmer, Marc Kirschenbaum
2006 Proceedings of the 2006 international workshop on Software engineering for large-scale multi-agent systems - SELMAS '06  
AOP facilitates the modeling of the system-wide behavior, thus it serves as a valuable tool for building confidence that a given multi-agent system will consistently meet its requirements.  ...  We present an Aspect-Oriented Programming (AOP) framework for modeling, visualizing and manipulating emergent structure in multi-agent systems.  ...  The agent on a vertex that is conflict free is in a happy state and will retain their color choice for the next iteration, while an agent on a vertex with a color conflict will randomly choose whether  ... 
doi:10.1145/1138063.1138075 fatcat:5v6ryhjyp5am7khma3gj3ayxwm

Characterizing heterogeneity in cooperative networks from a resource distribution view-point

Waseem Abbas, Magnus Egerstedt
2014 Communications in Information and Systems  
In particular, we formulate a graph coloring problem in which each node is assigned a subset of labels from a labeling set, and a graph is considered to be completely heterogeneous whenever all the labels  ...  The total number of different resources that can be accommodated within a system under this setting depends on the underlying graph structure of the network.  ...  Graph coloring based model of heterogeneous networks Graph theoretic tools are frequently applied to model and analyze various cooperative networks including sensor networks, multiagent, and multirobot  ... 
doi:10.4310/cis.2014.v14.n1.a1 fatcat:tuduoinxtbf6th66eqgzpjyz4m

Reliable fault tolerant model for grid computing environments

Mohammed Rebbah, Yahya Slimani, Abdelkader Benyettou, Lionel Brunie
2015 Multiagent and Grid Systems  
We propose, in this paper, a decentralized model of fault tolerance based on dynamic colored graphs.  ...  From this model, we show through some experiments, the benefits of colored graphs to manage failures in grids.  ...  Section 4 describes our proposition for modeling a grid with a dynamic colored graph; it also discusses issues vertex coloring, the computation of the tolerance threshold, the graph stabilization and the  ... 
doi:10.3233/mgs-140224 fatcat:iwdzdm745ratvohk74um7zjmam

Comparative Performance of Modified Simulated Annealing with Simple Simulated Annealing for Graph Coloring Problem

Anindya Jyoti Pal, Biman Ray, Nordin Zakaria, Samar Sen Sarma
2012 Procedia Computer Science  
Here, we have designed modified Simulated Annealing (MSA) for optimal vertex coloring of a simple, symmetric and connected graph (GCP).  ...  Coloring of the vertices of a graph with minimum number of colours belongs to the same category, where the algorithm designers are trying to propose some new algorithms for better result.  ...  A union crossover, originally designed by Costa [23] for a scheduling application, was adapted for graph coloring to implement the cooperation step.  ... 
doi:10.1016/j.procs.2012.04.034 fatcat:mfal6ftu7bemfmei2kaatgpt7i

A data-driven 3D vision feedback system for bilateral rehabilitation application

Xiang Kui, Guo Shuxiang, Song Zhibin
2012 2012 IEEE International Conference on Mechatronics and Automation  
A mini even free vision feedback system is on demand when rehabilitation trainings need to be implemented at home. In this study a vision feedback system is developed based on open source software.  ...  These exported files are re-loaded in a graph interface built with wxWidgets and rendered with OpenGL.  ...  A new vision feedback system oriented to rehabilitation application is design based on a professional human character and MTx sensors.  ... 
doi:10.1109/icma.2012.6285086 fatcat:qgg65jbtuzgpveynwtjnlinjwq

Adaptive Petri net based on irregular cellular learning automata with an application to vertex coloring problem

S. Mehdi Vahidipour, Mohammad Reza Meybodi, Mehdi Esnaashari
2016 Applied intelligence (Boston)  
To evaluate the efficiency of the proposed system, several algorithms, based on the APN-ICLA for vertex coloring problem, are designed.  ...  In this paper, an adaptive Petri net system based on Irregular Cellular Learning Automata (ICLA), in which a number of learning automata cooperate with each other, is proposed.  ...  Finally, several algorithms based on the APN-ICLA will be designed to solve the vertex coloring problem in graphs.  ... 
doi:10.1007/s10489-016-0831-x fatcat:aynqpqd2hvdfvhnmeh4b6cgyhe

The Development of Research-Based Learning Tools with a STEM Approach to Improve Metaliteracy Skills to Solve Rainbow Vertex Anti-magic Coloring Problems

Qurrotul A'yun, Slamin Slamin, Dafik Dafik
2022 Pancaran Pendidikan  
Metaliteracy is the framing and strengthening of information literacy based on critical and creative thinking.  ...  To implement higher-order thinking skills, we implement research-based learning with a STEM approach.  ...  The first learning device is the Lesson Plan; this Lesson Plan is prepared on the topic of rainbow vertex anti-magic coloring, and a research-based learning model with a STEM approach.  ... 
doi:10.25037/pancaran.v11i2.391 fatcat:l7imd5aivzd5baaiwh6aej27dy

A Survey on Graph Processing Accelerators: Challenges and Opportunities [article]

Chuangyi Gui, Long Zheng, Bingsheng He, Cheng Liu, Xinyu Chen, Xiaofei Liao, Hai Jin
2019 arXiv   pre-print
In this paper, we conduct a systematical survey regarding the design and implementation of graph processing accelerator.  ...  Despite a wealth of existing efforts on developing graph processing systems for improving the performance and/or energy efficiency on traditional architectures, dedicated hardware solutions, also referred  ...  Also, some accelerators follow a vertex-centric processing model while others choose the edge-centric model. Note that there is also one graph accelerator based on the hybrid model.  ... 
arXiv:1902.10130v1 fatcat:p5lzlf3gubckfpu4eowgo4myi4

Comparing and Evaluating Organizational Models: A Multi-agent Programming Contest Case Study [chapter]

Mariana Ramos Franco, Jaime Simão Sichman
2015 Lecture Notes in Computer Science  
An important subset of multi-agent systems (MAS) are based on organizational models. These models try to define pre-defined intended agent interaction patterns.  ...  In this work, we compare and evaluate different organization models of a MAS, whose goal is to evolve in the "Agents on Mars" scenario proposed in the Multi-Agent Programming Contest (MAPC).  ...  A zone is a subgraph covered by a team according to a coloring algorithm based on the notion of domain [14] .  ... 
doi:10.1007/978-3-319-25420-3_12 fatcat:dgpnwmu6l5a45gxo7x4wdpkcc4

Gunrock: GPU Graph Analytics [article]

Yangzihao Wang, Yuechao Pan, Andrew Davidson, Yuduo Wu, Carl Yang, Leyuan Wang, Muhammad Osama, Chenshan Yuan, Weitang Liu, Andy T. Riffel and John D. Owens
2017 arXiv   pre-print
"Gunrock", our graph-processing system designed specifically for the GPU, uses a high-level, bulk-synchronous, data-centric abstraction focused on operations on a vertex or edge frontier.  ...  We characterize the performance of various optimization strategies and evaluate Gunrock's overall performance on different GPU architectures on a wide range of graph primitives that span from traversal-based  ...  Thanks to the Altair and Vega-lite teams in the Interactive Data Lab at the University of Washington for graphing help. Joe Mako provided the speedup chart design.  ... 
arXiv:1701.01170v1 fatcat:kgx3yuxsrzegvkbo6x7tz5jbba

How Much Frequency Can Be Reused in 5G Cellular Networks---A Matrix Graph Model [article]

Yaoqing Yang, Bo Bai, Wei Chen
2014 arXiv   pre-print
In this paper, a new model---the matrix graph is proposed which takes advantage of the small cell size and high inter-cell interference to reduce computation complexity.  ...  An algorithm dealing with this model is also given, which asymptotically achieves the theoretical limit of frequency allocation, and has a complexity which decreases with cell size and grows linearly with  ...  In summary, we designed a graph-based approach suitable in small cells, which complements the insufficiencies of hexagonal grid models and conflict graph models; we designed an algorithm to allocate frequencies  ... 
arXiv:1401.4750v3 fatcat:o5uedqhj5ffafaxoksj4lgj7ii
« Previous Showing results 1 — 15 out of 5,719 results