A distributed algorithm for constructing a minimum diameter spanning tree
M Bui, F Butelle, C Lavault - Journal of Parallel and Distributed Computing, 2004 - Elsevier
We present a new algorithm, which solves the problem of distributively finding a minimum
diameter spanning tree of any (non-negatively) real-weighted graph G=(V,E,ω). As an …
diameter spanning tree of any (non-negatively) real-weighted graph G=(V,E,ω). As an …
[HTML][HTML] Smart grid and optimization
M Ahat, SB Amor, M Bui, A Bui, G Guérard… - 2013 - scirp.org
With urging problem of energy and pollution, smart grid is becoming ever important. By
gradually changing the actual power grid system, smart grid may evovle into different systems by …
gradually changing the actual power grid system, smart grid may evovle into different systems by …
A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks
Spanning trees help removing cycles and establishing short paths between a given node
and the rest of the nodes in a network. In ad hoc mobile computing networks, however, …
and the rest of the nodes in a network. In ad hoc mobile computing networks, however, …
[PDF][PDF] Tunisian dialect and modern standard arabic dataset for sentiment analysis: Tunisian election context
…, M Liwicki, R Ingold, M Bui - … conference on Arabic …, 2016 - karimsayadi.github.io
With the growth in use of social media platform, Sentiment Analysis methods become more
and more popular while for classical Arabic there are many datasets available, most of the …
and more popular while for classical Arabic there are many datasets available, most of the …
Optimizing automated trading systems with deep reinforcement learning
M Tran, D Pham-Hi, M Bui - Algorithms, 2023 - mdpi.com
In this paper, we propose a novel approach to optimize parameters for strategies in automated
trading systems. Based on the framework of Reinforcement learning, our work includes …
trading systems. Based on the framework of Reinforcement learning, our work includes …
Combining Latent Dirichlet Allocation and K-means for documents clustering: effect of probabilistic based distance measures
QV Bui, K Sayadi, SB Amor, M Bui - … 2017, Kanazawa, Japan, April 3-5 …, 2017 - Springer
This paper evaluates through an empirical study eight different distance measures used on
the LDA + K-means model. We performed our analysis on two miscellaneous datasets that …
the LDA + K-means model. We performed our analysis on two miscellaneous datasets that …
Detecting anomalies in the dynamics of a market index with topological data analysis
NKK Nguyen, M Bui - International Journal of Systematic Innovation, 2021 - ijosi.org
We investigate the behavior of a market index by using the persistence diagram of its time-delay
embedding, a powerful tool of the Topological Data Analysis approach. Furthermore, we …
embedding, a powerful tool of the Topological Data Analysis approach. Furthermore, we …
DevOps model appproach for monitoring smart energy systems
Energy systems are often socio-technical complex systems that are facing new challenges
regarding technological and environmental changes. Because of their complex nature, they …
regarding technological and environmental changes. Because of their complex nature, they …
A distributed algorithm for the maximum flow problem
TL Pham, I Lavallee, M Bui… - The 4th International …, 2005 - ieeexplore.ieee.org
This paper presents an asynchronous distributed algorithm for solving the maximum flow
problem which is based on the preflow-push approach of Golberg-Tarjan. Each node in graph …
problem which is based on the preflow-push approach of Golberg-Tarjan. Each node in graph …
A multi-criteria document clustering method based on topic modeling and pseudoclosure function
QV Bui, K Sayadi, M Bui - … of the 6th International Symposium on …, 2015 - dl.acm.org
We address in this work the problem of document clustering. Our approach is based on the
following pipeline. First, we quantify the topics in a document. Then, a number of clusters is …
following pipeline. First, we quantify the topics in a document. Then, a number of clusters is …