Skip to main content
OpgaverKonkurrencerArtiklerRangliste
Indlæser...
01Vilkår og betingelser02Privatlivspolitik03Kontakt

© 2026 MLCompete. Alle rettigheder forbeholdes.

    Tilgængelige opgaver

    Opgaver

    Udforsk og løs maskinlæringsudfordringer.

    Have an idea? Propose a problem

    Filtre

    Sværhedsgrad
    Kategorier
    Konkurrencer

    110 opgaver

    01
    Svær#320

    Fleet Recovery

    Coordinate two robots with one shared policy under actuator stalls, limited batteries, and hidden layouts.

    Forfatter: Echipa științifică ONIADin bedste score:N/A
    Se opgave
    02
    Svær#318

    Noisy Oracle Labyrinth

    Build a cost-aware adaptive DAG for noisy ternary identification that remains robust under receiver shift.

    Forfatter: Echipa științifică ONIADin bedste score:N/A
    Se opgave
    03
    Svær#316

    Echoes under Drift

    Recognize known and unknown audio events, locate their boundaries, and remain calibrated under domain shift.

    Forfatter: Echipa științifică ONIADin bedste score:N/A
    Se opgave
    04
    Svær#314

    Silent Transmitters

    Design an adaptive decision graph that robustly identifies a transmitter in at most 15 calls.

    Forfatter: Echipa științifică ONIADin bedste score:N/A
    Se opgave
    05
    Svær#312

    Courier Recovery

    Train a delivery policy that recovers from actuator stalls and generalizes to hidden layouts.

    Forfatter: Echipa științifică ONIADin bedste score:N/A
    Se opgave
    06
    Svær#310

    Nightwatch Soundscapes

    Detect overlapping sound events over time while adapting to new classes without forgetting the old ones.

    Forfatter: Echipa științifică ONIADin bedste score:N/A
    Se opgave
    07
    Svær#308

    Det analytiske sprog (John Wilkins)

    Identificer skjulte dyr med højst 15 kald ved adaptivt at vælge yes/no-spørgsmål og gæt.

    Forfatter: IOAI 2026 Organizing TeamDin bedste score:N/A
    Se opgave
    08
    Svær#306

    John Wilkins' analytiske sprog - deterministisk orakel

    Udarbejd en adaptiv YES/NO-question-politik, der identificerer hvert animal i et katalog med 250 kandidater ved brug af højst 15 kald.

    Forfatter: IOAI CommitteeDin bedste score:N/A
    Se opgave
    09
    Svær#304

    Akademiet for robotlevering

    Træn en model til adfærdskloning til at levere pakker på ukendte 8 × 8-kort.

    Forfatter: IOAI 2026 Organizing TeamDin bedste score:N/A
    Se opgave

    Side 1 af 13

    ForrigeNæste

    Contribute to the catalog

    Build the challenge you would want to solve

    Bring together the statement, data, evaluator, and scoring model in a private draft. If the proposal is accepted, the published problem is credited to you and appears on your profile.

    Your draft and evaluator stay private while the platform team validates safety, clarity, and scoring.

    Start a problem proposalRead the evaluator guide