Filtrer vos résultats
- 124
- 2
- 66
- 51
- 7
- 2
- 123
- 3
- 1
- 1
- 4
- 1
- 4
- 1
- 4
- 2
- 2
- 1
- 2
- 3
- 3
- 9
- 6
- 3
- 9
- 3
- 6
- 10
- 4
- 4
- 5
- 3
- 3
- 7
- 4
- 3
- 1
- 1
- 4
- 3
- 3
- 3
- 3
- 119
- 7
- 123
- 5
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 126
- 17
- 9
- 8
- 8
- 6
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
126 résultats
EFFICIENT PARALLEL ALGORITHMS FOR THE LIS AND LCS PROBLEMS ON BSR MODEL USING CONSTANT NUMBER OF SELECTIONSInternational Journal of Parallel, Emergent and Distributed Systems, 2000, 14 (3), pp.187-202. ⟨10.1080/10637199808947386⟩
Article dans une revue
hal-03238068v1
|
|||
Designing modular linear systolic arrays using dependence graph regular partitionsLecture Notes in Computer Science, vol 634., pp.265-270, 1992, ⟨10.1007/3-540-55895-0_421⟩
Chapitre d'ouvrage
istex
hal-03238146v1
|
|||
A fully-pipelined solutions constructor for dynamic programming problemsLecture Notes in Computer Science, vol 497., pp.421-430, 1991, ⟨10.1007/3-540-54029-6_191⟩
Chapitre d'ouvrage
istex
hal-03238149v1
|
|||
Secure permutation routing protocol in multi-hop wireless sensor networksSAM'11: At WORLDCOMP'11, 2011, Las Vegas Nevada, USA, United States. pp.691-696
Communication dans un congrès
hal-01007658v1
|
|||
Fault tolerant mutual and k-mutual exclusion algorithms for single-hop mobile ad hoc networksIJAHUC - International Journal of Ad Hoc and Ubiquitous Computing, 2006, 1 (3), pp.156. ⟨10.1504/IJAHUC.2006.009885⟩
Article dans une revue
hal-03237818v1
|
|||
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⟩
Communication dans un congrès
hal-03237774v1
|
|||
Optimal BSR Solutions to Several Convex Polygon ProblemsJournal of Supercomputing, 2002, 21 (1), pp.77-90. ⟨10.1023/A:1013587415197⟩
Article dans une revue
istex
hal-03238051v1
|
|||
|
|
WoS-CoMS: Work Stealing-Based Congestion Management Scheme for SDN Programmable NetworksJournal of Network and Systems Management, 2024, 32 (1), pp.23. ⟨10.1007/s10922-023-09798-1⟩
Article dans une revue
hal-04502536v1
|
||
A coarse-grained multicomputer parallel algorithm for the sequential substring constrained longest common subsequence problemParallel Computing, 2022, 111, pp.102927. ⟨10.1016/j.parco.2022.102927⟩
Article dans une revue
hal-03694677v1
|
|||
Geometric Based Methodology for Synthesizing Linear Systolic Arrays from the Winograd's AlgorithmInternational Conference on Parallel Computing Technologies, (PACT-93), Sep 1993, Obninsk, Russia
Communication dans un congrès
hal-03277684v1
|
|||
Heterogeneous Clustering for Secure, Energy-efficient and Fault tolerant Permutation Routing in Wireless Sensor NetworksInternational Journal of Advanced Computer Science, 2013, vl. 3 (5), pp. 249-258
Article dans une revue
hal-03276276v1
|
|||
Parallélisme et RépartitionHermès, 1998, ISBN 2-86601-686-6
Ouvrages
hal-03271700v1
|
|||
Quelques applications sur le model de calcul parallèle BSRParallélisme et répartition, Hermès, 1998, 2-86601-686-6
Chapitre d'ouvrage
hal-03271655v1
|
|||
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⟩
Communication dans un congrès
hal-03275943v1
|
|||
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⟩
Communication dans un congrès
hal-03236525v1
|
|||
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⟩
Communication dans un congrès
hal-03238054v1
|
|||
A CONSTANT TIME PARALLEL DETECTION OF REPETITIONSParallel Processing Letters, 2011, 09 (01), pp.81-92. ⟨10.1142/S0129626499000104⟩
Article dans une revue
hal-03238073v1
|
|||
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⟩
Communication dans un congrès
hal-03238096v1
|
|||
SYNTHESIZING LINEAR SYSTOLIC ARRAYS FOR DYNAMIC PROGRAMMING PROBLEMSParallel Processing Letters, 2011, 02 (01), pp.97-110. ⟨10.1142/S0129626492000222⟩
Article dans une revue
hal-03238142v1
|
|||
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⟩
Communication dans un congrès
hal-01007652v1
|
|||
An Efficient Permutation Routing Protocol in Multi-Hop Wireless Sensor NetworksInternational Journal of Advancements in Computing Technology (IJACT), 2011, 3 (6), pp.207-214
Article dans une revue
hal-01007656v1
|
|||
|
|
FSB-DReViSeR: Flow Splitting-Based Dynamic Replacement of Virtual Service Resources for Mobile Users in Virtual Heterogeneous NetworksJournal of Computer Networks and Communications, 2020, 2020 (1), pp.1-14. ⟨10.1155/2020/8891481⟩
Article dans une revue
hal-03236449v1
|
||
Quelques Remarques sur la Structure des Bifurcations du Difféomorphisme du Cercle.Comptes rendus de l'Académie des sciences. Série I, Mathématique, 1984, 299 (18)
Article dans une revue
hal-03269161v1
|
|||
|
|
A dominant point-based parallel algorithm that finds all longest common subsequences for a constrained-MLCS problemJournal of computational science, 2020, 40, pp.101070. ⟨10.1016/j.jocs.2019.101070⟩
Article dans une revue
hal-03236480v1
|
||
An Efficient BSP/CGM Algorithm for the Matrix Chain Ordering ProblemPDPTA, vol.1, p. 327-332, 2008, Las Vegas, United States
Communication dans un congrès
hal-03267731v1
|
|||
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
Communication dans un congrès
hal-03251301v1
|
|||
Parallel dynamic programming for solving the optimal search binary tree problem on CGMInternational Journal of High Performance Computing and Networking, 2014, 7 (4), pp.269-280. ⟨10.1504/IJHPCN.2014.062729⟩
Article dans une revue
hal-01017394v1
|
|||
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⟩
Communication dans un congrès
hal-03107823v1
|
|||
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
Communication dans un congrès
hal-03269238v1
|
|||
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
Communication dans un congrès
hal-03268028v1
|