{"id":"W1486218346","doi":"10.1007/978-3-642-15323-5_7","title":"A New Method to Find Developmental Descriptions for Digital Circuits","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Electronic circuit; Field-programmable gate array; Modular design; Digital electronics; Function (biology); Scalability; Theoretical computer science; Computer engineering; Parallel computing; Computer architecture; Algorithm; Arithmetic; Computer hardware; Mathematics; Programming language; Electrical engineering","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006256424,0.001072404,0.0007104956,0.003385141,0.001239242,0.001955705,0.002087937,0.001111302,0.01913233],"category_scores_gemma":[0.002882438,0.0007552864,0.001761269,0.001985259,0.001082806,0.003427538,0.001864546,0.00181346,0.004909628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007148096,"about_ca_system_score_gemma":0.000864803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0015429,"about_ca_topic_score_gemma":0.002615714,"domain_scores_codex":[0.9995272,0.00006156427,0.0000438682,0.0001407388,0.0001941724,0.00003244574],"domain_scores_gemma":[0.9991477,0.0003610811,0.00003489591,0.0001839497,0.0002349922,0.00003746346],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007146014,0.00005861682,0.0005550795,0.0004549603,0.00005498061,0.0002605439,0.0004535546,0.008630903,0.01333922,0.4498585,0.01468112,0.5115811],"study_design_scores_gemma":[0.00006796044,0.00009132108,0.0005203753,0.0002089863,0.0001514009,0.001358825,0.0003705265,0.2521928,0.02468477,0.4965601,0.2236945,0.00009838022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001499844,0.0001108053,0.9915461,0.00006000166,0.00006443958,0.00007257515,0.0002300114,0.000932131,0.005484126],"genre_scores_gemma":[0.02088071,0.0002260312,0.9654666,0.00005460397,0.00003594696,0.0002341105,0.0007150672,0.0005923182,0.01179459],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01913233,"threshold_uncertainty_score":0.06400394,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02700422935292478,"score_gpt":0.2789725459408953,"score_spread":0.2519683165879705,"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."}}