The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
While the 15-puzzle has a long and interesting history dating back to the 1870s, it still continues to appear as apps on mobile devices and as minigames inside larger video games. We demonstrate a method for solving the 15-puzzle using only 4.7 MB of tables that on a million random instances was able to find solutions of 65.21 moves on average and 95 moves in the worst case in under a tenth of a millisecond...
Traveling salesman Problem (TSP) is a classical NP-hard problem and has been extensively studied in literature. Eliminating the cross paths, which commonly exist in approximate solutions to large scale TSP, can effectively improve the quality of the solutions. Through studying the impact of cross paths on the cost of a loop, in this paper we develop a method to detect and dismantle cross paths, and...
Greedy algorithm for which situation of users' number more than free channel's number gives tacit consent to each user could receive one sub-channel. This is very different from virtual situation. For this reason, this text has improved the greedy algorithm. In allocation progress of spectrum resources, the conflict of secondary users and authorized users on time domain has to be considered, and also...
Competitive facility location problems (CFLP) form a wide class of optimization problems. A new facility is to location and the market share captured by each facility depends on its distance to customers and its location costs. This paper proposes a new location problem of competitive facilities where the service capability of each facility is considered. The aggregation effects which could appear...
Positive Influence Dominating Set (PIDS) has applications in Online Social Networks (OSN) such as Viral Marketing and College Drinking Problem. To many reasons finding Minimum PIDS (MPIDS) is very desirable. Beside, one of the most important features that distinguish the graph of OSN from other networks is Power-Law degree distribution. Unfortunately computing MPIDS in Power-Law graph is a NP-Complete...
The aim of this paper is to research an existing just-in-time scheduling problems. Moreover, we propose a new algorithm for a just-in-time scheduling problem, and perform a comparison between it and an existing algorithm. The proposed algorithm has been based on the greedy algorithm. The greedy algorithm is the search method updating a solution in the direction where the improvement effect of the...
In this paper we establish a new algorithm based on greedy method and Genetic Algorithms to solve course timetabling problem. Timetabling is a kind of problem in which events (classes, exams, courses, etc) have to be arranged into a number of timeslots such that conflicts in using a given set of resources are avoided. First, the greedy method is used to achieve automatic course arrangement and obtain...
As an unsupervised learning method, spectral clustering is widely used in machine learning. Spectral clustering algorithms apply spectral graph theory to solve the clustering of non-convex sphere of sample spaces, so that they can be converged to global optimal solution. After the essence of initialization sensitivity in spectral clustering is analyzed, the prim algorithm is used to select the k initial...
The goal of a map coloring problem is to color a map so that regions sharing a common border have different colors, map-coloring problem is a classic NP-complete graph optimization problem, which has many real-world applications. From analyzing the characters of greedy algorithm, we proposed a new map coloring approach, which includes sorting the coloring regions based on the touch number among each...
Knapsack problem is a typical computer algorithm of NP complete (Nondeterministic Polynomial Completeness) problem. The research of solving this problem has great significance not only in theory, but also in application, for example, resource management, investment decisions and so on. For solving this problem, scholars have developed a number of algorithms, however, they are all have some drawbacks...
The fuzzy rules-based weighted sum Genetic Algorithm (Fuzzy-WSGA) is proposed in the paper to solve the multi-objective fixed-charged transportation optimization problem (mfcTP). We put forward the elite preserving strategy when the Pareto optimal solutions are built by the arena's principle, which used weighted sum based on the AP algorithm to evaluate the fitness function and preserve the elite...
This paper addresses a problem to decide the combination of risk-reducing plans quickly. The combinatorial problem is formulated as one of the 0-1 integer programming and Branch and Bound is applied. On Branch and Bound, Simplex method for deciding a branching variable and the lower bound, which takes much time. Therefore, we propose the high-speed decision reducing calculations of a combination using...
The timetabling problem is a NP-complete problem which has been committed to finding a solution by the field of operations research and computer but has not got a good solution. The timetabling is the most important problem in the course scheduling. With the development of disciplines, the change of the size and direction of enrollment, increasing the difficulty of the Course Scheduling. This paper...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.