|
|
|
|
|
Elias Munapo, Joshua Chukwuere and Trust Tawanda
We present a technique to solve the linear integer model with variable bounding. By using the continuous optimal solution of the linear integer model, the variable bounds for the basic variables are approximated and then used to calculate the optimal int...
ver más
|
|
|
|
|
|
|
|
|
|
|
Abdelhak Etchiali, Fethallah Hadjila and Amina Bekkouche
Currently, the selection of web services with an uncertain quality of service (QoS) is gaining much attention in the service-oriented computing paradigm (SOC). In fact, searching for a service composition that fulfills a complex user?s request is known t...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jong-Shin Chen, Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi and Yung-Fa Huang
Supergrid graphs are derived by computing stitch paths for computerized embroidery machines. In the past, we have studied the Hamiltonian-related properties of supergrid graphs and their subclasses of graphs. In this paper, we propose a generalized graph...
ver más
|
|
|
|
|
|
|
|
|
|
|
Virginia Niculescu and Robert Manuel Stefanica
A general crossword grid generation is considered an NP-complete problem and theoretically it could be a good candidate to be used by cryptography algorithms. In this article, we propose a new algorithm for generating perfect crosswords grids (with no bl...
ver más
|
|
|
|
|
|
|
|
|
|
|
Fatemeh Keshavarz-Kohjerdi and Ruo-Wei Hung
A graph is called Hamiltonian connected if it contains a Hamiltonian path between any two distinct vertices. In the past, we proved the Hamiltonian path and cycle problems for general supergrid graphs to be NP-complete. However, they are still open for s...
ver más
|
|
|
|
|
|
|
|
|
|
|
Michal Berlinski, Eryk Warchulski and Stanislaw Kozdrowski
This paper presents a logistics problem, related to the transport of goods, which can be applied in practice, for example, in postal or courier services. Two mathematical models are presented as problems occurring in a logistics network. The main objecti...
ver más
|
|
|
|
|
|
|
|
|
|
|
András Faragó and Zohre R. Mojaveri
The Disjoint Connecting Paths problem and its capacitated generalization, called Unsplittable Flow problem, play an important role in practical applications such as communication network design and routing. These tasks are NP-hard in general, but various...
ver más
|
|
|
|
|
|
|
|
|
|
|
Gianluca Reali and Mauro Femminella
Network caching is a technique used to speed-up user access to frequently requested contents in complex data networks. This paper presents a two-layer overlay network caching system for content distribution. It is used to define some caching scenarios wi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Suleiman Sa?ad, Abdullah Muhammed, Mohammed Abdullahi, Azizol Abdullah and Fahrul Hakim Ayob
Recently, cloud computing has begun to experience tremendous growth because government agencies and private organisations are migrating to the cloud environment. Hence, having a task scheduling strategy that is efficient is paramount for effectively impr...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sergey Kurapov,Maxim Davidovsky
Pág. 1 - 8
In general, a universal algorithm for testing a pair of graphs G and H for isomorphism exists. It is grounded on the fact that the rows and the corresponding columns of the adjacency matrix of the graph G can be rearranged until it turns into another, eq...
ver más
|
|
|
|
|
|