Filtrer vos résultats
- 3
- 1
- 3
- 1
- 4
- 1
- 1
- 2
- 4
- 4
- 3
- 3
- 2
- 4
- 4
- 3
- 2
- 2
- 1
- 1
- 1
|
|
triés par
|
A Learning Based Branch and Bound for Maximum Common Subgraph Related ProblemsTHIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, Feb 2020, New-York, United States. pp.2392-2399
Communication dans un congrès
hal-03636418v1
|
|||
|
Hybrid Learning with New Value Function for the Maximum Common Induced Subgraph Problemaaai2023, 2023, Washington, United States. pp.4044-4051, ⟨10.1609/aaai.v37i4.25519⟩
Communication dans un congrès
hal-04145340v1
|
||
A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique ProblemTHIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, Feb 2018, New-Orleans, United States. pp.1338-1346
Communication dans un congrès
hal-03636425v1
|
|||
A new upper bound for the maximum weight clique problemEuropean Journal of Operational Research, 2018, 270 (1), pp.66-77. ⟨10.1016/j.ejor.2018.03.020⟩
Article dans une revue
hal-03636424v1
|