{"id":"W3016074430","doi":"10.1023/b:mone.0000031585.26814.2d","title":"A Parallel Hill Climbing Algorithm for Pushing Dependent Data in Clients–Providers–Servers Systems","year":2004,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Computer science; Random access; Server; Access time; Algorithm; Computer network; Permutation (music); Hill climbing; Operating system","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.001180384,0.0008350823,0.001867031,0.0008777719,0.001642483,0.001066052,0.002490082,0.001690087,0.004277313],"category_scores_gemma":[0.002417663,0.0009519178,0.0009968588,0.001388257,0.0007435544,0.001112581,0.001417968,0.001143595,0.0008074963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001085508,"about_ca_system_score_gemma":0.002221264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0193327,"about_ca_topic_score_gemma":0.01705681,"domain_scores_codex":[0.9994047,0.0001573412,0.00003600348,0.00007169227,0.0002152128,0.0001151249],"domain_scores_gemma":[0.9990508,0.0004058882,0.00005712769,0.0001316379,0.0002526645,0.0001017607],"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.00008408855,0.00007694839,0.0002641301,0.00004936009,0.00004480858,0.00005334457,0.00004499549,0.950446,0.0009617109,0.003783155,0.002631951,0.04155948],"study_design_scores_gemma":[0.000016773,0.00001320922,0.00003429998,0.000001625635,0.00000426363,0.000006712136,0.000005389235,0.9984669,0.000133772,0.001071017,0.0002424665,0.000003455988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02919419,0.0002877157,0.963636,0.0002986098,0.0001358592,0.000244852,0.0001098747,0.001086317,0.005006572],"genre_scores_gemma":[0.341062,0.0002221647,0.6508299,0.0001816883,0.00008173563,0.0004207746,0.0002479387,0.0002448435,0.006708877],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0193327,"threshold_uncertainty_score":0.03844035,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01970672827753642,"score_gpt":0.2657152183151447,"score_spread":0.2460084900376083,"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."}}