نتایج جستجو برای: dynamic sleepwake up algorithm
تعداد نتایج: 1948834 فیلتر نتایج به سال:
The dynamic reconfiguration of the interconnection network is an advanced feature of some multicomputers to reduce the communication overhead. Up to now, the work carried out in this field has focused on static switching, i.e., the network changes its topology before starting the execution of a phase of an application program and then it remains constant throughout the phase execution. However,...
Based on environmental awareness and effective path planning algorithm, effective robot path planning can be achieved. In this paper, the Kinect sensor, the latest vision sensing technology, is used to perceive the obstacles and terrain information in dynamic environment in real-time, which enables robots to realize effective path planning tasks in complex dynamic environment. Using the real-im...
This paper presents an overview of methods inspired by the behaviour of real ants in the nature which are currently in the focus of research and which have been used in the process of electrocardiogram interpretation and processing. The paper describes the use of dynamic time warping algorithm used together with ant colony inspired clustering and considers the relevant steps to speed up the alg...
In this paper, we present an adaptive Gerchberg-Saxton algorithm for phase retrieval. One of the drawbacks of the original Gerchberg-Saxton algorithm is the poor results it yields for very bright images. In this paper we demonstrate how a dynamic phase retrieval approach can improve the correlation between the required image and the reconstructed image by up to 10 percent. The paper gives expli...
String matching algorithm is one of the key technologies in numerous network security applications and systems. Nowadays, the increasing network bandwidth and pattern set size both calls for high speed string matching algorithm for large-scale pattern set. This paper proposes a novel algorithm called Multi-phase Dynamic Hash (MDH), which cut down the memory requirement by multi-phase hash and e...
The evolution of a dynamic walking gait of biped robot is presented in this paper. The gait is generated for a biped robot to walk on flat ground and climb up stairs. For the trajectory based gait generation, various parameters satisfy ZMP criterion and can realize continuous walking. The evolutionary algorithm is used to choose the parameter combinations. Simulation studies show that the algor...
A low complexity dynamic subcarrier and power allocation methodology for downlink communication in an OFDM-based multiuser environment is developed. The problem of maximizing overall capacity with constraints on total power consumption, bit error rate and data rate proportionality among users requiring different QOS specifications is formulated. Assuming perfect knowledge of the instantaneo...
Dynamic shortest path algorithms update the shortest paths to take into account a change in an edge weight. This paper describes a new technique that allows the reduction of heap sizes used by several dynamic shortest path algorithms. For unit weight change, the updates can be done without heaps. These reductions almost always reduce the computational times for these algorithms. In computationa...
This paper presents an algorithm for Dynamic MAP inference and the computation of min-marginals in boolean outer-planar MRFs. Our goal is to efficiently solve an instance of the MAP problem given that we have already solved a related instance. As an example of Dynamic MAP inference, we consider the problem of computing minmarginals. The theoretical contribution of this paper is that we prove th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید