{"id":"W599153350","doi":"10.1016/j.jpdc.2015.06.004","title":"Tradeoffs between cost and information for rendezvous and treasure hunt","year":2015,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Rendezvous; Treasure; Computer science; Traverse; Advice (programming); Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Node (physics); A priori and a posteriori; Situated; Network topology; Topology (electrical circuits); Combinatorics; Computer network; Mathematics; Telecommunications; Artificial intelligence; Physics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003810421,0.0007794392,0.00173376,0.001976399,0.001047005,0.003334146,0.002388825,0.002830536,0.01200407],"category_scores_gemma":[0.04361625,0.0007884552,0.0006367672,0.001536663,0.001979572,0.008048253,0.0025412,0.001528083,0.001097052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00138525,"about_ca_system_score_gemma":0.001259165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002252063,"about_ca_topic_score_gemma":0.002809712,"domain_scores_codex":[0.9977731,0.0007340461,0.00009257967,0.0002398544,0.0006162517,0.0005441516],"domain_scores_gemma":[0.9552994,0.03809109,0.001200701,0.002843973,0.001600256,0.0009645071],"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.006876255,0.0004252289,0.006020481,0.0006141869,0.000190206,0.0005680511,0.0004842606,0.599772,0.01743885,0.2160017,0.004118498,0.1474904],"study_design_scores_gemma":[0.0002310514,0.0006060215,0.003924481,0.00007982409,0.0001374325,0.0006362205,0.0005296423,0.8318446,0.008117717,0.151992,0.001777464,0.0001235964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7097361,0.004051663,0.2169172,0.003777986,0.00023696,0.0001484482,0.000567237,0.001162187,0.06340219],"genre_scores_gemma":[0.9865566,0.0003021457,0.01038799,0.00005299292,0.00004030124,0.00002128576,0.00008202617,0.0001106342,0.002446002],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01200407,"threshold_uncertainty_score":0.04015762,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05024629657989928,"score_gpt":0.2861500957210397,"score_spread":0.2359037991411404,"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."}}