in this paper, tender problems in an automobile company for procuring needed items from potential suppliers have been resolved by the learning algorithm q. in this case the purchaser with respect to proposals received from potential providers, including price and delivery time is proposed; order the needed parts to suppliers assigns. the buyer’s objective is minimizing the procurement costs thr...

nowadays project management is a key component in introductory operations management. the educators and the researchers in these areas advocate representing a project as a network and applying the solution approaches for network models to them to assist project managers to monitor their completion. in this paper, we evaluated project’s completion time utilizing the q-learning algorithm. so the ...

in the present paper‎, ‎we propose an iterative algorithm for‎ ‎solving the generalized $(p,q)$-reflexive solution of the quaternion matrix‎ ‎equation $overset{u}{underset{l=1}{sum}}a_{l}xb_{l}+overset{v} ‎{underset{s=1}{sum}}c_{s}widetilde{x}d_{s}=f$‎. ‎by this iterative algorithm‎, ‎the solvability of the problem can be determined automatically‎. ‎when the‎ ‎matrix equation is consistent over...

In the present paper‎, ‎we propose an iterative algorithm for‎ ‎solving the generalized $(P,Q)$-reflexive solution of the quaternion matrix‎ ‎equation $overset{u}{underset{l=1}{sum}}A_{l}XB_{l}+overset{v} ‎{underset{s=1}{sum}}C_{s}widetilde{X}D_{s}=F$‎. ‎By this iterative algorithm‎, ‎the solvability of the problem can be determined automatically‎. ‎When the‎ ‎matrix equation is consistent over...

We give an algorithm for counting points on arbitrary ordinary elliptic curves over finite fields of characteristic 2, extending the O(log q) method given by Takakazu Satoh, giving the asymptotically fastest point counting algorithm known to date.