| http://www.w3.org/ns/prov#value | - opCondition() do 13 foreach P ??? Population do 14 Pvelocity ??? UpdateVelocity(Pvelocity , Pg best , Pp best ); 15 Pposition ??? UpdatePosition(Pposition , Pvelocity ); 16 Pcost ??? Cost(Pposition ); 17 if Pcost ??? Pp best then 18 Pp best ??? Pposition ; 19 if Pcost ??? Pg best then 20 Pg best ??? Pp best ; 21 end 22 end 23 end 24 end 25 return Pg best ; problem is an instance of a continuous fu
|
