نتایج جستجو برای: generate large candidate path sets
تعداد نتایج: 1546478 فیلتر نتایج به سال:
This paper presents a terrain mapping and path planning techniques for a planetary exploration rover. A light detection and ranging (LIDAR) is employed in this work to obtain a point cloud data of the terrain feature. A terrain map converted from the point cloud data is represented with a sector-shaped reference grid, resulting in a digital elevation map with the cylindrical coordinate, called ...
We consider the problem of recovering channel code parameters over a candidate set by merely analyzing received encoded signals. propose deep learning-based solution that I) is capable identifying for any coding scheme (such as LDPC, Convolutional, Turbo, and Polar codes), II) robust against impairments like multi-path fading, III) does not require previous knowledge or estimation state signal-...
This paper presents two path relinking algorithms to solve the unconstrained binary quadratic programming (UBQP) problem. One is based on a greedy strategy to generate the relinking path from the initial solution to the guiding solution and the other operates in a random way. We show extensive computational results on five sets of benchmarks, including 31 large random UBQP instances and 103 str...
Most behavioral synthesis and design for testability techniques target subsequent gate-level sequential test generation, which is frequently incapable of handling complex controller/data path circuits with large data path bit-widths. Hierarchical testing attempts to counter the complexity of test generation by exploiting information from multiple levels of the design hierarchy. We present techn...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید