Facility allocation plays a crucial role in modern urban planning and design. However, the allocation of various facilities in a reasonable manner is a complex problem involving high-dimensional multi ...
Making a class schedule is one of those NP hard problems. The problem can be solved using a heuristic search algorithm to find the optimal solution, but it only works for simple cases. For more ...
Abstract: Path planning algorithms are current research hotspots. Heuristic algorithms that can solve dynamic environment problems are gradually becoming the mainstream research direction. The D* ...
Concrete is one of the most commonly used materials in construction engineering, and its compressive strength is an important reference index for structural design and construction. As a multiphase ...
Algorithms have taken on an almost mythical significance in the modern world. They determine what you see on social media and when browsing online, help form people’s belief systems, and impact the ...
Abstract: Based on the theories and methods of operations research, a mathematical model for the shortest rescue route during gas leak emergencies in high-sulfur oil and gas fields is built in this ...
The propositional satisfiability problem (SAT) was the first to be shown NP-complete by Cook and Levin. SAT remained the embodiment of theoretical worst-case hardness. However, in stark contrast to ...
The identification of synthetic routes that end with the desired product is considered an inherently time-consuming process that is largely dependent on expert knowledge regarding a limited proportion ...
Solving the sliding puzzle using a basic AI algorithm. I had published this article on Medium in September of 2018. I have decided to create more content on my LinkedIn profile, thus rewriting this ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results