Aller au contenu principal
  • Vous êtes
  • Un Etudiant
  • Une Entreprise
  • Un journaliste
  • Actualités
  • Offres d'emploi
  • Presse
  • Je fais un don
Accueil Accueil
  • École
    • Etablissement
      • Histoire de l'Ecole
      • Stratégie 2023-2032
      • Gouvernance
      • Chiffres clés
    • DDRS
      • Centre des Diversités et de l’Inclusion
      • Egalité Femmes-Hommes
      • Développement durable
      • Handicap
    • International
    • Partenaires et réseaux
      • Université Paris-Saclay
      • Groupe des Ecoles Centrale
      • Entreprises & Mécènes
      • Partenaires académiques
    • La Fondation
    • CentraleSupélec Alumni
  • Formations
    • Bachelors
      • Bachelor in AI, Data & Management Sciences
      • Bachelor in Global Engineering
      • Bachelor HEPTA
      • Bachelor Innovation Engineering
    • Ingénieurs
      • Ingénieur généraliste
      • Ingénieur Spécialité Cybersécurité
      • Ingénieur Spécialité Electronique
      • Ingénieur Spécialité Energie
      • Ingénieur Spécialité Informatique
      • Ingénieur Spécialité Physique
      • Ingénieur Spécialité Systèmes Numériques
    • Masters
      • MSc in Industry Transformation Management
      • MSc in Artificial Intelligence
      • MSc in DataSciences and Business Analytics
      • MSc&T in Space Business Strategy
      • Masters
    • Doctorats
    • Programmes courts
      • Shift Year
      • Digital Tech Year
      • Summer School
      • Summer Camp
    • Executive education
  • Recherche
    • Le centre de recherche
    • Laboratoires
    • Chaires et laboratoires communs
    • Grands équipements
    • Science & société
    • Annuaire des chercheurs
    • Liste des publications
  • Entrepreneuriat
    • 21st by CentraleSupélec
    • Les programmes d'accompagnement
    • Nos campus & lieux de vie
  • Entreprises
    • Devenir partenaire
    • Nos entreprises partenaires mécènes
    • Nous soutenir
  • Vie de campus
    • Découvrir nos Campus
      • Campus de Metz
      • Campus de Paris Saclay
      • Campus de Rennes
    • Logements
    • La santé étudiante
    • Sports
    • Bibliothèque
  • Search

Rechercher

Les sujets les plus recherchés

Formations
International
Actualités
Contact
Extranet
  • publication 06/01/2025
    A Multilingual Approach to Discover Cross-Language Links in Wikipedia
  • publication 06/01/2025
    Entity Discovery and Annotation in Tables
  • publication 06/01/2025
    Determining the interests of social media users: two approaches
  • publication 06/01/2025
    Wikipedia-based extraction of key information from resumes
  • publication 13/05/2025
    Generating Referring Expressions from RDF Knowledge Graphs for Data Linking
  • publication 06/01/2025
    RE-miner for data linking results for OAEI 2020
  • publication 06/01/2025
    Knowledge Graph Refinement based on Triplet BERT-Networks
  • publication 06/01/2025
    MINERVE - Un jumeau numérique pour gérer l'infrastructure ferroviaire
  • publication 06/01/2025
    MOMENT: temporal meta-fact generation and propagation in knowledge graphs
  • publication 06/01/2025
    On Simulated Annealing Dedicated to Maximin Latin Hypercube Designs
  • publication 06/01/2025
    Bandit-Based Optimization on Graphs with Application to Library Performance Tuning
  • publication 28/08/2014
    A Survey of Meta-Heuristics used for Computing Maximin Latin Hypercube
  • publication 06/01/2025
    Fixed-parameter tractability of counting small minimum (S,T)-cuts
  • publication 06/01/2025
    The Competitiveness of Randomized Strategies for Canadians via Systems of Linear Inequalities
  • publication 06/01/2025
    Completion of partial Latin Hypercube Designs: NP-completeness and inapproximability
  • publication 06/01/2025
    Search space exploration and an optimization criterion for hard design problems
  • publication 06/01/2025
    TracInAD: Measuring Influence for Anomaly Detection
  • publication 06/01/2025
    Restricting the search space to boost Quantum Annealing performance
  • publication 06/01/2025
    Introduction de connaissances expertes en Bandit-Based Monte-Carlo Planning avec application au Computer-Go
  • publication 06/01/2025
    The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem
  • publication 06/01/2025
    Biasing Monte-Carlo Simulations through RAVE Values
  • publication 06/01/2025
    Current Frontiers in Computer Go
  • publication 06/01/2025
    Intelligent Agents for the Game of Go
  • publication 06/01/2025
    On the Parallelization of Monte-Carlo planning
  • publication 06/01/2025
    Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows
  • publication 06/01/2025
    Grid coevolution for adaptive simulations; application to the building of opening books in the game of Go
  • publication 06/01/2025
    On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts
  • publication 06/01/2025
    Multiple Overlapping Tiles for Contextual Monte Carlo Tree Search
  • publication 06/01/2025
    Micro-Doppler Signal Representation for Drone Classification by Deep Learning
  • publication 06/01/2025
    On the parameterized complexity of separating certain sources from the target
  • publication 06/01/2025
    Adding expert knowledge and exploration in Monte-Carlo Tree Search
  • publication 06/01/2025
    A Novel Ontology for Computer Go Knowledge Management
  • publication 06/01/2025
    Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts
  • publication 06/01/2025
    Multiple Canadians on the road: minimizing the distance competitive ratio
  • publication 06/01/2025
    A lower bound for weak Schur numbers with a deterministic algorithm
  • publication 06/01/2025
    On the competitiveness of memoryless strategies for the $k$-Canadian Traveller Problem
  • publication 06/01/2025
    Combiner connaissances expertes, hors-ligne, transientes et en ligne pour l'exploration Monte-Carlo
  • publication 06/01/2025
    Fixed-parameter tractability of counting small minimum $(S,T)$-cuts
  • publication 06/01/2025
    The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments
  • publication 06/01/2025
    Procédé et dispositif de réception de signaux
  • publication 06/01/2025
    Fast performance prediction method of iterative MMSE-IC receivers in MU-MIMO CDMA systems
  • publication 06/01/2025
    Achieving High Spectral Efficiency with Adaptive Layered Space-Time Codes under Rate Control
  • publication 06/01/2025
    A new iterative equalizer based on a deterministic annealing scheme
  • publication 06/01/2025
    Frequency Domain Block Turbo Equalization for Single-Carrier Transmission over MIMO Broadband Wireless Channel
  • publication 06/01/2025
    Relaying functions for the multiple access relay channel
  • publication 06/01/2025
    Method for transmitting a digital signal in a semi-orthogonal frame system having a half-duplex relay, and correspoding program product and relay device
  • publication 06/01/2025
    Turbo Space-Time Chip Equalization and Channel Estimation for Overloaded MIMO HSDPA
  • publication 06/01/2025
    Iterative Receiver Architecture for MIMO HSDPA Evolution
  • publication 06/01/2025
    Iterative Decoding : A Unifying Factor Graph Approach
  • publication 06/01/2025
    Partial waterfilling with reduced feedback for sum discrete-rate maximization in single-user MIMO
  • Première page « Premier
  • Page précédente ‹‹
  • …
  • Page 62
  • Page 63
  • Page 64
  • Page 65
  • Page courante 66
  • Page 67
  • Page 68
  • Page 69
  • Page 70
  • …
  • Page suivante ››
  • Dernière page Dernier »
  • Suivez-nous

Campus de Paris-Saclay

3 Rue Joliot Curie
91190 Gif-sur-Yvette

01 75 31 60 00

A propos

  • CentraleSupélec
  • Entreprises
  • International
  • Nos campus
  • Actualités
  • Agenda

Formations

  • Bachelors
  • Ingénieurs
  • Masters
  • Doctorats
  • Programmes courts
  • Executive education

Recherche

  • Centre de recherche
  • Laboratoires
  • Chaires et laboratoires communs
  • Science & société
  • Annuaire des chercheurs
  • Publications

Autres sites

  • 21st by CentraleSupélec
  • Paris Digital Lab
  • Fondation CentraleSupélec
  • CentraleSupélec Alumni

© 2025 CentraleSupelec

  • Contact
  • Mentions légales
  • Accessibilité
  • Presse
Image
Ministère de l'enseignement Supérieur et de la Recherche
Image
Ministère chargé des comptes publics
Image
CTI
Image
Conférence des grandes écoles
Image
CDEFI
Image
Bienvenue en France
Image
Développement Durable & Responsabilité sociétale
Image
EUR-ACE
Image
Centrale méditerranée
Image
Centrale Lyon
Image
CentraleLille
Image
CentraleNantes