About: Jean-Frédéric Myoupo

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Jean-Frédéric Myoupo Goto Sponge NotDistinct Permalink

An Entity of Type : foaf:Person, within Data Space : data.idref.fr associated with source document(s)

Attributes	Values
type	Person
sameAs	Myoupo, Jean-Frédéric Myoupo, Jean-Frédéric Myoupo, Jean-Frédéric Myoupo, Jean-Frédéric Myoupo, Jean-Frédéric
bnf-onto:FRBNF	13530351(xsd:integer)
preferred label	Myoupo, Jean-Frédéric
name	Jean-Frédéric Myoupo
dbpedia-owl:citizenship	http://sws.geonames.org/3017382/
Language	http://lexvo.org/id/iso639-3/fra
isni:identifierValid	0000000358077062
Given name	Jean-Frédéric
familyName	Myoupo
note	En poste au LaRIA, Laboratoire de recherche en informatique d'Amiens, Université Picardie-Jules Verne (en 1998)
ORCID iD	0000-0003-3657-2556
Scopus ID	6602174721
is sameAs of	Myoupo, Jean-Frédéric Myoupo, Jean-Frédéric Myoupo, Jean-Frédéric
is Thesis advisor of	http://www.sudoc.fr/043698336/id http://www.sudoc.fr/142283681/id Solutions parallèles efficaces sur le modèle CGM d'une classe de problèmes issus de la programmation dynamique Partitionnement et geocasting dans les réseaux mobiles Ad Hoc et collecte des données dans les réseaux de capteurs sans fil Architectures parallèles systoliques pour la compression de données et la manipulation des sous-chaînes http://www.sudoc.fr/16701188X/id http://www.sudoc.fr/174379307/id http://www.sudoc.fr/053758455/id http://www.sudoc.fr/174233035/id http://www.sudoc.fr/117796867/id http://www.sudoc.fr/060015896/id http://www.sudoc.fr/253941555/id Qualité de services dans les protocoles de multicast géographique et de routage par permutation dans les réseaux de capteurs sans fil La programmation dynamique non-serial dans les modèles de calcul parallèle BSP/CGM http://www.sudoc.fr/259570591/id Initialisation et routage par permutation dans les réseaux mobiles ad hoc http://www.sudoc.fr/24804009X/id http://www.sudoc.fr/224312715/id http://www.sudoc.fr/247152285/id http://www.sudoc.fr/248039830/id http://www.sudoc.fr/248022059/id Applications du partitionnement des réseaux de capteurs sans fil au multicast géographique et au tri partiel
is Praeses of	http://www.sudoc.fr/184662362/id
is Author of	http://www.sudoc.fr/043018017/id http://www.sudoc.fr/016933109/id http://www.sudoc.fr/016940326/id High Performance CGM-based Parallel Algorithms for the Optimal Binary Search Tree Problem Dynamic programming on linear pipelines An Efficient Parallel Solution for the Longest Increasing Subsequence Problem. A dominant point-based parallel algorithm that finds all longest common subsequences for a constrained-MLCS problem A basis for 3-D cellular networks Vers un protocole de routage efficace et sécurisé pour les réseaux de capteurs sans fil hiérarchiques distribués. Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory A fully-pipelined solutions constructor for dynamic programming problems Hexagonal Mesh: A New Addressing Scheme and an Optimal Routing Algorithm. A Physical DPT and Regional CSP-Based Hybrid Algorithm for Energy Efficiency in Target Tracking in Wireless Sensor Networks An Efficient CGM-Based Parallel Algorithm Solving the Matrix Chain Ordering Problem Conflict-free rerouting scheme through flow splitting for virtual networks using switches A One-Phase Parallel Algorithm for the Sequence Alignment Problem Parallel Solutions for the Maximum-Segment-Sum Problem. https://zbmath.org/6585386#id A work-optimal CGM algorithm for the LIS problem An Application of an Initialization Protocol to Permutation Routing in a Single-Hop Mobile Ad Hoc Networks Permutation Routing, Ranking and Sorting Algorithms on the Coarse-Grain Broadcast Communication Model With Few Channel Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problem Quelques Remarques sur la Structure des Bifurcations du Difféomorphisme du Cercle. Mapping dynamic programming onto modular linear systolic arrays Secure permutation routing protocol in multi-hop wireless sensor networks Deployment of Sparse Sensor-Actuator Network in a Virtual Architecture ALL-TO-ALL BROADCASTING ALGORITHMS ON HONEYCOMB NETWORKS AND APPLICATIONS Data Gathering in a Virtual Architecture for Wireless Sensor Networks With Some Empty Clusters. Wireless Ad Hoc Networking Special issue Edited by J.F. Myoupo, Studia Informatica Universalis vol. 6(1) A mobility-management mechanism for broadcasting in unknown mobile ad hoc networks An Efficient BSP/CGM Algorithm for the Matrix Chain Ordering Problem Dynamic programming on linear systolic arrays WoS-CoMS: Work Stealing-Based Congestion Management Scheme for SDN Programmable Networks APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ † Exact Computations of the Longest Repeated Suffix Ending at Each Point in a Word A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem FSB-DReViSeR: Flow Splitting-Based Dynamic Replacement of Virtual Service Resources for Mobile Users in Virtual Heterogeneous Networks Dynamic initialization protocols for mobile ad hoe networks Markov Chain Based-Protocols for Dynamic Initialization of Single-Hop Ad Hoc Mobile Networks. Deriving CGM Based-Parallel Algorithms for the Optimal Binary Search-Tree Problem Average case analysis-based protocols to initialize packet radio networks An Energy-Efficient Clique-Based Geocast Algorithm for Dense Sensor Networks An Optimal Parallel Solution for a Geometrical Matching Problem Using BSR Model. Multi-geocast Algorithms for Wireless Sparse or Dense Ad Hoc Sensor Networks Designing modular linear systolic arrays using dependence graph regular partitions Méthode numérique de détermination des courbes de bifurcation dans une récurrence de Hénon Fault-tolerant and energy-efficient routing protocols for a virtual three-dimensional wireless sensor network Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems Efficient parallel computing of the length of a longest common subsequence of three strings A coarse-grained multicomputer parallel algorithm for the sequential substring constrained longest common subsequence problem http://www.sudoc.fr/016244389/id http://www.sudoc.fr/016255534/id On the Performance of a Hierarchical Clustering Based-Geocast Algorithm in Wireless Sensor Networks with Guaranteed Delivery Parallel dynamic programming for solving the optimal search binary tree problem on CGM Efficient BSR-based parallel algorithms for geometrical problems Solving dynamic programming problems efficiently on modular linear pipelines A Realistic Approach for Energy-Saving Permutation Routing Protocol in Mobile Ad Hoc Networks

Faceted Search & Find service v1.13.91 as of Aug 16 2018

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3229 as of May 14 2019, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (70 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software