{"id":"W34586909","doi":"10.1007/978-1-4419-7997-1_13","title":"Algorithms and Metaheuristics for Combinatorial Matrices","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Metaheuristic; Computer science; Combinatorial optimization; Theoretical computer science; Algorithm","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":[],"consensus_categories":[],"category_scores_codex":[0.00009857494,0.0002440155,0.0003370649,0.00006240141,0.00003967074,0.00005611878,0.00009614217,0.000277038,0.000282484],"category_scores_gemma":[0.000005010105,0.0002151906,0.0000924539,0.000009458297,0.00003107274,0.000045591,0.00001807604,0.0001252662,0.0001048042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001175143,"about_ca_system_score_gemma":0.000004357068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003002084,"about_ca_topic_score_gemma":7.324027e-7,"domain_scores_codex":[0.999386,0.000003734342,0.0002234994,0.0001532525,0.00009166786,0.0001418597],"domain_scores_gemma":[0.9995722,0.0001113061,0.00004095038,0.0001603476,0.00004557077,0.00006964371],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000002565479,0.00000175352,2.922793e-7,0.0002800128,0.0001507447,0.000001438734,0.00001679699,0.000007327053,0.000008525652,0.9804125,0.0162597,0.00285839],"study_design_scores_gemma":[0.0002818143,0.00004169989,6.957769e-7,0.00004271966,0.0001191178,0.000006791194,0.000007623015,0.002142855,0.00004618756,0.3373856,0.6596109,0.0003139925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00004672252,0.00488736,0.005195589,0.000006555514,0.004346084,0.0006713727,0.0001105211,0.0003575601,0.9843782],"genre_scores_gemma":[0.01191573,0.001316088,0.003627312,0.00002645717,0.001835447,0.0001288679,0.00008814912,0.0002629207,0.980799],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.6433512,"threshold_uncertainty_score":0.8775218,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01086642970334756,"score_gpt":0.1917957286960095,"score_spread":0.1809292989926619,"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."}}