{"id":"W117128401","doi":"","title":"Parallel implementation of an ant colony optimization metaheuristic with OpenMP","year":2001,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Metaheuristic; Computer science; Parallel metaheuristic; Ant colony optimization algorithms; Parallel computing; Scheduling (production processes); Job shop scheduling; Mathematical optimization; Graphics; Algorithm; Routing (electronic design automation); Embedded system; Meta-optimization; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.006234899,0.0004082684,0.0006034072,0.0004803634,0.0003074621,0.0008121348,0.003087908,0.0002291983,0.0003529992],"category_scores_gemma":[0.0008241786,0.0004149052,0.0001319344,0.00109751,0.0002487716,0.0006124781,0.00189508,0.0005448598,0.00001503631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001565672,"about_ca_system_score_gemma":0.0009719766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001926173,"about_ca_topic_score_gemma":0.0007275663,"domain_scores_codex":[0.9897875,0.006419915,0.0009483953,0.00119297,0.0011707,0.0004805273],"domain_scores_gemma":[0.9895948,0.0009340005,0.001102707,0.003239609,0.004813683,0.000315253],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009668933,0.002747626,0.001997798,0.000643677,0.0006032226,0.00008883678,0.01427879,0.5689728,0.00043088,0.2128782,0.0009220042,0.1963394],"study_design_scores_gemma":[0.001155984,0.000004628963,0.001544213,0.000380984,0.00006784924,0.00002750788,0.0001279206,0.9885737,0.005470552,0.001463623,0.0006975807,0.0004854158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004097098,0.0001988273,0.984971,0.00288638,0.0001444888,0.001119601,0.00006147354,0.0002215569,0.0062995],"genre_scores_gemma":[0.07210775,0.0005737326,0.9244248,0.00005815809,0.00001977169,0.000177458,0.0008169626,0.00005587944,0.001765526],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4196009,"threshold_uncertainty_score":0.9998303,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02143430337804501,"score_gpt":0.2869342218692247,"score_spread":0.2654999184911797,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}