{"id":"W1545291929","doi":"10.5555/1402821.1402931","title":"Optimized algorithms for multi-agent routing","year":2008,"lang":"en","type":"article","venue":"","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Bidding; Computer science; Routing (electronic design automation); Mathematical optimization; Robot; Computation; Vehicle routing problem; Domain (mathematical analysis); Algorithm; Artificial intelligence; Mathematics; Computer network","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001060724,0.00006283736,0.0001209903,0.00005812686,0.0004826542,0.00004041397,0.0002945638,0.00003344924,0.0009231222],"category_scores_gemma":[0.0007837958,0.00004294134,0.0001086093,0.0002633584,0.00007144221,0.0001266317,0.00004266186,0.00003932535,0.0006907879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001141496,"about_ca_system_score_gemma":0.00002393918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006086721,"about_ca_topic_score_gemma":9.485453e-7,"domain_scores_codex":[0.9989526,0.0000432805,0.0003303059,0.000266643,0.0002707816,0.0001363622],"domain_scores_gemma":[0.9987678,0.000593481,0.00009962586,0.0002979574,0.0001698875,0.00007123673],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001965029,0.0009256037,0.001417802,0.00000354428,0.00007982716,0.000007898967,0.004589826,0.01952172,0.002531812,0.4937892,0.1936926,0.2832437],"study_design_scores_gemma":[0.002893868,0.00005748815,0.001718583,0.000003230316,0.00001304837,0.00005938071,0.003163615,0.6342964,0.01117563,0.03887676,0.3073789,0.0003631187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00560607,0.00001009921,0.9883874,0.0007442684,0.0001594099,0.0002502966,0.00000831597,0.00007520841,0.004758941],"genre_scores_gemma":[0.3148786,0.000005902418,0.6089014,0.0005892597,0.000125003,0.0001196488,0.000003649553,0.000007988339,0.07536857],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6147747,"threshold_uncertainty_score":0.9999902,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3847822534337136,"score_gpt":0.4565785468484889,"score_spread":0.07179629341477523,"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."}}