Jean frédéric Myoupo
Publications
Publications
|
|
WoS-CoMS : Work Stealing-based Congestion Management Scheme for SDN programmable networks2024 |
A Centralized and Conflict-Free Routing Table Update Method through Triplets' Lists Vector in SDN Architectures2018 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI), Oct 2018, Guangzhou, China. pp.1509-1515, ⟨10.1109/SmartWorld.2018.00261⟩ |
|
Coarse-Grained Multicomputer Based-Parallel Algorithms for the Longest Common Subsequence Problem with a String-Exclusion Constraint2018 International Conference on High Performance Computing & Simulation (HPCS), Jul 2018, Orleans, France. pp.1038-1044, ⟨10.1109/HPCS.2018.00163⟩ |
|
Speeding up Coarse Grain Multicomputer Based Parallel Algorithm for Optimal Binary Search Tree by Minimizing Idleness of Processors2017 IEEE 19th International Conference on High Performance Computing and Communications, IEEE 15th International Conference on Smart City and IEEE 3rd International Conference on Data Science and Systems (HPCC/SmartCity/DSS), Dec 2017, Bangkok, Thailand. pp.605-608, ⟨10.1109/HPCC-SmartCity-DSS.2017.79⟩ |
|
|
|
Deriving CGM Based-Parallel Algorithms for the Optimal Binary Search-Tree Problem13th International Conference on Information Technology, Jun 2016, Las Vegas, United States. pp.655--665, ⟨10.1007/978-3-319-32467-8⟩ |
Collision-free Routing Protocol in Multi-hop Wireless Sensor NetworksInternational Conference on Computer and Information Technology, Oct 2015, Liverpool, United Kingdom. pp.92-99, ⟨10.1109/CIT/IUCC/DASC/PICOM.2015.16⟩ |
|
Cliques and Clusters based Hierarchical Scheme for Sensor Networks PartitioningGCC 2013, Nov 2013, Doha, Qatar. pp.355-360, ⟨10.1109/IEEEGCC.2013.6705804⟩ |
|
Mapping dynamic programming problems on coarse grained multicomputerInternational Conference on Information and Automation (ICIA 2012) P. 487-499, Jun 2012, Shenyang, China |
|
A Partial Sorting Algorithm in Multi-Hop Wireless Sensor NetworksICWN 2011: At WORLDCOMP'11, 2011, Las Vegas Nevada, USA, United States. pp.68-74 |
|
Secure permutation routing protocol in multi-hop wireless sensor networksSAM'11: At WORLDCOMP'11, 2011, Las Vegas Nevada, USA, United States. pp.691-696 |
|
Deployment of Sparse Sensor-Actuator Network in a Virtual ArchitectureICWN 2011: At WORLDCOMP'11, 2011, Las Vegas Nevada, USA, United States. pp.126-134 |
|
On the Performance of a Hierarchical Clustering Based-Geocast Algorithm in Wireless Sensor Networks with Guaranteed DeliverySENSORCOMM 2010, 2010, Venice/Mestre, Italy, Italy. pp.250-255, ⟨10.1109/SENSORCOMM.2010.46⟩ |
|
Load Balancing Schemes for Parallel Processing of Dynamic Programming on BSP/CGM ModelPDPTA 2010, 2010, Las Vegas, Nevada, USA, United States. pp.710-716 |
|
A Physical DPT and Regional CSP-Based Hybrid Algorithm for Energy Efficiency in Target Tracking in Wireless Sensor NetworksICN 2010, 2010, Menuires, France, France. pp.127-132, ⟨10.1109/ICN.2010.30⟩ |
|
A Course-Grain Multicomputer Algorithm for the Minimum Cost Parenthesization ProblemPDPTA 2009, 2009, Las Vegas, Nevada, USA, United States. pp.480-486 |
|
Randomized multi-stage clustering-based geocast algorithms in anonymous wireless sensor networksIWCMC 2009, Jun 2009, Leipzig, Germany, Germany. pp.286-291, ⟨10.1145/1582379.1582442⟩ |
|
A clustering Group Mutual Exclusion algorithm for mobile ad hoc networksISCC 2009, Jul 2009, Sousse, Tunisia, Tunisia. pp.693-696, ⟨10.1109/ISCC.2009.5202340⟩ |
|
Multi-geocast Algorithms for Wireless Sparse or Dense Ad Hoc Sensor NetworksFourth International Conference on Networking and Services (icns 2008), Mar 2008, Gosier, France. pp.35-39, ⟨10.1109/ICNS.2008.50⟩ |
|
A Cluster-Based Distributed Scheme for Intrusion Control in Mobile Ad Hoc Networks.International Conference on Wireless Networks (ICWN’08), vol.1, p. 488-493, 2008, Las Vegas, United States |
|
An Efficient BSP/CGM Algorithm for the Matrix Chain Ordering ProblemPDPTA, vol.1, p. 327-332, 2008, Las Vegas, United States |
|
Vers un protocole de routage efficace et sécurisé pour les réseaux de capteurs sans fil hiérarchiques distribués.The Third International Conference on Risks and Security of Internet and Systems (CRiSIS), Oct 2008, Tozeur, Tunisie |
|
Data Gathering in a Virtual Architecture for Wireless Sensor Networks With Some Empty Clusters.International Conference on Wireless Networks (ICWN’08), vol.1, p. 75-81, 2008, Las Vegas, United States |
|
A Coarse Grain Multicomputer Algorithm Solving the Optimal Binary Search Tree Problem2008 Fifth International Conference on Information Technology: New Generations (ITNG), Apr 2008, Las Vegas, United States. pp.1186-1189, ⟨10.1109/ITNG.2008.158⟩ |
|
An Operationnal Model for Mobile Target Tracking in Wireless Sensor NetworksInternational Symposium on Wireless Pervasive Computing (ISWPC 2007), IEEE Catalog N° 07EX1480C, Feb 2007, San Juan, Puerto Rico. ⟨10.1109/ISWPC.2007.342581⟩ |
|
A Realistic Approach for Energy-Saving Permutation Routing Protocol in Mobile Ad Hoc NetworksInternational conference on wireless and optical communications (WOC 2007), p.514-518, Jun 2007, Montréal, Canada |
|
Self-localization and connectivity maintenance scheme for target tracking in wireless sensor networksInternational conference on wireless and optical communications (WOC 2007), p. 343-348, Jun 2007, Montréal, Canada |
|
An Algorithm for a Constraint Optimization Problem in Mobile Ad-hoc Networks2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06), Nov 2006, Arlington, United States. pp.555-562, ⟨10.1109/ICTAI.2006.29⟩ |
|
GPS-Free Geocasting Algorithms in Mobile Ad hoc Networks2006 International Conference on Wireless and Mobile Communications (ICWMC'06), Jul 2006, Bucharest, Romania. pp.38-38, ⟨10.1109/ICWMC.2006.47⟩ |
|
AWeighted Clustering Algorithm For Mobile Ad Hoc NetworksWith Non Unique Weights2006 International Conference on Wireless and Mobile Communications (ICWMC'06), Jul 2006, Bucharest, Romania. pp.39-39, ⟨10.1109/ICWMC.2006.27⟩ |
|
A mobility-management mechanism for broadcasting in unknown mobile ad hoc networks2nd ACM Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (PE-WASUN' 2005), Oct 2005, Montreal, Canada. pp.242-245, ⟨10.1145/1089803.1089994⟩ |
|
A robot-Walk- Based Collaborative Algorithm for Target Tracking in Ad Hoc Sensor Networks2005 13th IEEE International Conference on Networks Jointly held with the 2005 IEEE 7th Malaysia International Conf on Communic, 2005, Kuala Lumpur, Malaysia. pp.451-456, ⟨10.1109/ICON.2005.1635524⟩ |
|
A Clustering Mutual Exclusion Protocol For Multi-Hop Mobile Ad Hoc Networks2005 13th IEEE International Conference on Networks Jointly held with the 2005 IEEE 7th Malaysia International Conf on Communic, 2005, Kuala Lumpur, Malaysia. pp.250-255, ⟨10.1109/ICON.2005.1635479⟩ |
|
An Implementation of an Energy-Saving Mutual Exclusion Protocol for Mobile Ad Hoc Networks.International Conference on Wireless Networks (ICWN'05, pp.341-347, 2005, Las Vegas, United States |
|
Towards a more realistic BSP cost modelEighth International Conference on High-Performance Computing in Asia-Pacific Region (HPCASIA'05), Jul 2005, Beijing, China. pp.10-12, ⟨10.1109/HPCASIA.2005.97⟩ |
|
An Energy-Saving Algorithm for the Initialization of Single Hop Mobile Ad Hoc Networks2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05), 2005, Montreal, Canada. pp.153-158, ⟨10.1109/ICW.2005.26⟩ |
|
Markov Chain Based-Protocols for Dynamic Initialization of Single-Hop Ad Hoc Mobile Networks.International Conference on Parallel and Distributed Computing and Networks (PDCN’05), p.38-43, 2005, Innsbruck,, Austria |
|
Dynamic initialization protocols for mobile ad hoe networksThe 11th IEEE International Conference on Networks, 2003. ICON2003., 2003, Sydney, Australia. pp.149-154, ⟨10.1109/ICON.2003.1266182⟩ |
|
Concurrent broadcasts-based permutation routing algorithms in radio networksISCC 2003 - International Symposium on Computers and Communications, 2003, Kemer-Antalya, Turkey. pp.1272-1276, ⟨10.1109/ISCC.2003.1214289⟩ |
|
A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence ProblemProceedings - 11th Euromicro Conference on Parallel, Distributed and Network-Based Processing, Euro-PDP 2003., Mar 2003, Gênes, Italy. pp.349--356, ⟨10.1109/EMPDP.2003.1183610⟩ |
|
Exact Computations of the Longest Repeated Suffix Ending at Each Point in a WordISCA 17th International Conference on Computers and their Applications (CATA), pp. 18-21., 2002, San Francisco,, United States |
|
Hexagonal Mesh: A New Addressing Scheme and an Optimal Routing Algorithm.Applied Informatics(AI’02), 2002, Innsbruck, Austria |
|
An Efficient All-To-All Communication Protocol in Honeycomb NetworksInternational Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS), 2002, San Diego, United States |
|
A work-optimal CGM algorithm for the LIS problemProceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures - SPAA 01, 2001, Crete Island, Greece. pp.330--331, ⟨10.1145/378580.378756⟩ |
|
|
|
Efficient BSR-based parallel algorithms for geometrical problemsNinth Euromicro Workshop on Parallel and Distributed Processing, 2001, Mantova, Italy. pp.265-272, ⟨10.1109/EMPDP.2001.905052⟩ |
An Optimal Parallel Solution for a Geometrical Matching Problem Using BSR Model.Intern. Conf. Parall. Distr. Process. Technique and Applications (PDPTA), pp.556-562, 2001, Las Vegas, United States |
|
A basis for 3-D cellular networksICOIN-15, 15th International Conference on Information Networking, 2001, Beppu City, Japan. pp.631-636, ⟨10.1109/ICOIN.2001.905525⟩ |
|
Move-to-front and transpose hybrid parallel architectures for high-speed data compression2000 International Conference on Performance, Computing and Communications (IPCCC 2000), 2000, Phoenix, United States. pp.67-75, ⟨10.1109/PCCC.2000.830303⟩ |
|
Collision Detection Based-Deterministic Protocols for Dynamic Inialization of Radio NetworksISCA Intern. Conf. Parall. Distr. Computt. systems, pp. 159-164., 2000, Las Vegas, United States |
|
A Dynamic Initialization of Radio NetworksIASTED Intern. Conf. Parall. Distr. Computt. systems, PDCS, PP.907-1001, 1999, Massachussetts Institute of Technilogy (MIT), Boston, 19, United States |
|
Star-Honey Meshes and Tori: Topological Properties, Communication Algorithms and Ring EmbeddingInternational Conference on Principles of Distributed Systems (OPODIS): 85-107, 1999, Hanoi, Vietnam |
|
Permutation Routing, Ranking and Sorting Algorithms on the Coarse-Grain Broadcast Communication Model With Few ChannelIASTED Intern. Conf. Parall. Distr. Computt. systems, PDCS, PP.45-50, 1998, Las Vegas, United States |
|
A 3-D Systolic Array for Computing the Length of a Longest Common Subsequence of Four Sequences11th ISCA International Conference on Computer Applications in Industry and Engineering, (CAINES), pp. 188-191, 1998, Las Vegas, United States |
|
A Parallel Solution of the the Sequence Alignment using BSR Model.ISCA Intern. Conf. Parall. Distr. Computt. systems, PP. 357-362, 1998, New Orleans, United States |
|
Efficient parallel computing of the length of a longest common subsequence of three stringsSIAM Conference on Parallel Processing for Scientific Computing (PPSC ), 1997, Minneapolis,, United States |
|
Designing Multiprocessor array Architecture for High-Speed Data Compression Using Static Huffman Codes.IEEE Intern. Conf. on Electronic Circuits and Systems, pp. 324-328, Dec 1997, Cairo, Egypt |
|
Improved Systolic Architecture for Transpose Heuristic.ISCA Intern. Conf. Parall. Distr. Comput. pp. 64-68., Sep 1996, Dijon, France |
|
A single-layer systolic architecture for backpropagation learningInternational Conference on Neural Networks (ICNN'96), 1996, Washington, United States. pp.1329-1333, ⟨10.1109/ICNN.1996.549091⟩ |
|
An efficient linear systolic algorithm for recovering longest common subsequences1st International Conference on Algorithms and Architectures for Parallel Processing, 1995, Brisbane, Australia. pp.20-29, ⟨10.1109/ICAPP.1995.472166⟩ |
|
Parallel Solutions for the Maximum-Segment-Sum Problem.SIAM Conference on Discrete Mathematics, Jun 1994, Alburquerque, New Mexico, United States |
|
An Efficient Parallel Solution for the Longest Increasing Subsequence Problem.International Conference on Computing and Information (ICCI), pp. 220-224., 1993, Laurentian University, Ontario, Canada |
|
Geometric Based Methodology for Synthesizing Linear Systolic Arrays from the Winograd's AlgorithmInternational Conference on Parallel Computing Technologies, (PACT-93), Sep 1993, Obninsk, Russia |
|
Solving dynamic programming problems efficiently on modular linear pipelinesEleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings], Apr 1992, Scottsdale, United States. pp.87-92, ⟨10.1109/PCCC.1992.200542⟩ |
|
A Way of Deriving Linear Systolic Arrays from a Mathematical Algorithm Description: Case of the Warshall-Floyd AlgorithmInternational Conference on Parallel Processing, ICPP '91, 1991, Austin, Texas, United States |
|
A Linear Systolic Array for Transitive Closure ProblemsInternational Conference on Parallel Processing,, 1990, Urbana-Champaign, United States |
|
Transitive closure and matrix product on modular linear systolic arrays.10th international Conference of the Chilean Computer Society. Santiago, pp. 275-287, 1990, Santiago, Chile |
|
Dynamic programming on linear systolic arrays28th Annual Allerton Conference on Communication, Control and Computing,, Oct 1990, Allerton House, Montecillo, Illinois,, United States. pp.254-261 |
|
Méthode numérique de détermination des courbes de bifurcation dans une récurrence de Hénon4ème Colloque des mathématiciens du Québec & 69th Ontario Mathematics Meeting,, Apr 1984, Université Laval à Québec, Canada |
Wireless Ad Hoc Networking Special issue Edited by J.F. Myoupo, Studia Informatica Universalis vol. 6(1)Hermès, 2008 |
|
Parallélisme et RépartitionHermès, 1998, ISBN 2-86601-686-6 |
Contribution à la synthèse des réseaux systoliquesInformatique [cs]. Université Paris - Saclay, 1994 |
Plan des bifurcations d’un difféomorphisme bi-dimensionnel cubiqueMathématiques [math]. Université Paul SAbatier, Toulouse, 1983. Français. ⟨NNT : ⟩ |