نتایج جستجو برای: non expansive mapping
تعداد نتایج: 1500290 فیلتر نتایج به سال:
We show that delaying fully-expansive proof reconstruction for non-interactive decision procedures can result in a more efficient workflow. In contrast with earlier work, our approach to postponed proof does not require making deep changes to the theorem prover.
As cities cope with rapid population growth—adding 2.5 billion dwellers by 2050—and grapple with expansive sprawl, politicians, planners, and architects have become increasingly interested in the vertical city paradigm. This paper reviews and examines shortfalls of tall buildings found in the literature to inform future developments. The paper gathers a vast amount of fragmented criticism and c...
The purpose of this paper is to introduce a modified Halpern-type iteration algorithm and prove strong convergence of the algorithm for quasi-φ-asymptotically non-expansive mappings. Our results improve and extend the corresponding results announced by many others.
Engineering problems shunned previously rise to the surface gradually with the activities of reforming the natural world in depth, the problem of expansive soil crack under the changing environment becoming a control factor of expansive soil slope stability. The problem of expansive soil crack has gradually become a research hotspot, elaborates the occurrence and development of cracks from the ...
Expansive soils swell when they absorb water and shrink when water evaporates from them. Hence, lightly loaded civil engineering structures founded in these soils are subjected to severe distress. Therefore, there is a need to ameliorate or improve these swelling soils through some innovative methods. This paper discusses chemical stabilisation of expansive soils, a technique in which chemical ...
In this paper, we have successfully demonstrated the semantic mapping and motion planning experiments on Turtlebot Robot using Microsoft Kinect in ROS environment. Moreover, we have also performed the comparative studies on various sampling based motion planning algorithms with Turtlebot in Open Motion Planning Library. Our comparative analysis revealed that Expansive Space Trees (EST) surmount...
In this paper we propose an efficient algorithm to perform a polynomial approximation of the vector field derived from the usual distance mapping method. The main ingredients consist of minimizing a quadratic functional and transforming this problem in an appropriate setting for implementation. With this approach, we reduce the problem of obtaining an approximating polynomial vector field to th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید