代码搜索:task
找到约 10,000 项符合「task」的源代码
代码结果 10,000
www.eeworm.com/read/159166/5588412
c task1.c
/*
*********************************************************************************************************
* 文件: Task1.C
* 描述: .
* 编写: 深思 (001-12345@sohu.com).
*********************************
www.eeworm.com/read/158224/5597854
task para_eval.task
Popu: init 10
Bounds: [-1.0,9.0,0.02]
Coding: Binary
EvalFun: gaDemo1Eval1 []
ParallelEvaluation: 2
CycleBegin: maxGenTerm 5
Select: RouletteSelect []
Crossover: BSinglePointXover [0.2]
www.eeworm.com/read/158224/5597860
task dejong2.task
Popu: init 100
Bounds: [-2.048,2.048,0.002;-2.048,2.048,0.002]
Coding: Real
EvalFun: DeJong2 []
CycleBegin: maxGenTerm 20
Select: normGeomSelect [1.1]
Crossover: RLinearXover [0.9]
www.eeworm.com/read/158224/5597861
task dejong3.task
Popu: init 20
Bounds: [-5.12,5.12,0.01;-5.12,5.12,0.01;-5.12,5.12,0.01;-5.12,5.12,0.01;-5.12,5.12,0.01]
Coding: Binary
EvalFun: DeJong3 []
CycleBegin: maxGenTerm 100
Select: RouletteSelect []
www.eeworm.com/read/158224/5597865
task dejong1.task
Popu: init 100
Bounds: [-5.12,5.12,0.01;-5.12,5.12,0.01;-5.12,5.12,0.01]
Coding: Binary
EvalFun: DeJong1 []
CycleBegin: maxGenTerm 100
Select: RouletteSelect []
Crossover: BSinglePointXo
www.eeworm.com/read/158224/5597868
task para_sub.task
Popu: init 100
Bounds: [-1.0,9.0,0.02]
Coding: Binary
EvalFun: gaDemo1Eval1 []
CycleBegin: maxGenTerm 5
Select: RouletteSelect []
Crossover: BSinglePointXover [0.2]
Mutation: Binary
www.eeworm.com/read/157105/5607568
c os_task.c
/*
*********************************************************************************************************
* uC/OS-II
*
www.eeworm.com/read/156538/5611413
c os_task.c
/*
*********************************************************************************************************
* uC/OS-II
*
www.eeworm.com/read/155856/5618754
c task1.c
/******************************************************************************/
/* */
/* Task 1: Count up Every 2 ticks
www.eeworm.com/read/155856/5618756
c task2.c
/******************************************************************************/
/* */
/* Task 2: Count as fast as possi