In this paper, two of the local search algorithms are used (genetic algorithm and particle swarm optimization), in scheduling number of products (n jobs) on a single machine to minimize a multi-objective function which is denoted as  (total completion time, total tardiness, total earliness and the total late work). A branch and bound (BAB) method is used for comparing the results for (n) jobs starting from (5-18). The results show that the two algorithms have found the optimal and near optimal solutions in an appropriate times.

   The research tackled to solve Sudoku grid problem 9 ×9 , one of artificial intelligence problems. This problem has many of solutions in search space to generate Sudoku grid by using magic square of odd order as 3. This research concludes solution by proposed heuristic algorithm from magic square of odd order as 3 and no given numbers (from 1 to 9) in each cell of nine Sudoku grid cells in starting of problem solution, this is not similar the solution in old classic methods to generate all sub grids in Sudoku grid. The experimental results in this paper show the easily implementation to solve the problem to manage without manual method, additional to position of numbers (1, 2,..9) in center of each sub grid in Sudoku grid

The file upload is one of the controls of the tool bar of the VisualStodio.NET, but it can’t be used with Ajax technology (It's almost impossible today to be involved in web application design or development and not be aware of Ajax) because the file upload control don’t support Ajax technology that the execution of the instruction is not completed or the (object is not set) message will appear, although the essential need to use this control with Ajax to gain the asynchronous data transfer that supplied by Ajax, because the file upload don’t work without the Postback operation from the client to the server, and the main idea of Ajax technology is working without Postback operation to the server. After the deep resea

In this paper, a new procedure is introduced to estimate the solution for the three-point boundary value problem which is instituted on the use of Morgan-Voyce polynomial. In the beginning, Morgan-Voyce polynomial along with their important properties is introduced. Next, this polynomial with aid of the collocation method utilized to modify the differential equation with boundary conditions to the algebraic system. Finally, the examples approve the validity and accuracy of the proposed method.

The Hopfield network is one of the easiest types, and its architecture is such that each neuron in the network connects to the other, thus called a fully connected neural network. In addition, this type is considered auto-associative memory, because the network returns the pattern immediately upon recognition, this network has many limitations, including memory capacity, discrepancy, orthogonally between patterns, weight symmetry, and local minimum. This paper proposes a new strategy for designing Hopfield based on XOR operation; A new strategy is proposed to solve these limitations by suggesting a new algorithm in the Hopfield network design, this strategy will increase the performance of Hopfield by modifying the architecture of t

The Assignment model is a mathematical model that aims to express a real problem facing factories and companies which is characterized by the guarantee of its activity in order to make the appropriate decision to get the best allocation of machines or jobs or workers on machines in order to increase efficiency or profits to the highest possible level or reduce costs or time To the extent possible, and in this research has been using the method of labeling to solve the problem of the fuzzy assignment of real data has been approved by the tire factory Diwaniya, where the data included two factors are the factors of efficiency and cost, and was solved manually by a number of iterations until reaching the optimization solution,

Most Internet of Vehicles (IoV) applications are delay-sensitive and require resources for data storage and tasks processing, which is very difficult to afford by vehicles. Such tasks are often offloaded to more powerful entities, like cloud and fog servers. Fog computing is decentralized infrastructure located between data source and cloud, supplies several benefits that make it a non-frivolous extension of the cloud. The high volume data which is generated by vehicles’ sensors and also the limited computation capabilities of vehicles have imposed several challenges on VANETs systems. Therefore, VANETs is integrated with fog computing to form a paradigm namely Vehicular Fog Computing (VFC) which provide low-latency services to mo