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.
The large graphs involving millions of vertices are common in many real life applications and are challenging to process. Now a day there are number of application like routing in telephone network, travelling Information System, Data Mining, Robotic System and its data is represented in a graph and different graph contains negative weight of edges or negative edge cycle and are inefficient to process...
Solutions to robotic manipulation problems can be substantially improved through integrated task and motion planning. Existing approaches typically focus on satisfaction, finding a feasible solution, instead of optimization. We formulate large-scale robotic manipulation problems as multi-level optimization, incorporating task, action, and motion planning. We develop an integrated planning approach...
In light of recent natural catastrophes and terrorist activities, it has become evident that new architectural approaches are needed for next generation public protection and disaster relief networks. These architectures should be adaptable to the conditions at the event site and resilient enough to operate under adverse conditions in an emergency. Furthermore, they should enable rapid gathering of...
Energy storage is a major concern in today's hybrid vehicular technology. The HEV operates with common load profile, described by relatively high peak to average power required. The complete system demands power source to be compact, lightweight and efficient with acceptable life cycle. Power source consisting of batteries which have high energy density and ultracapacitor which have high power density,...
Dynamic scheduling has been always a challenging problem for real-time distributed systems. EDF (Earliest Deadline First) algorithm has been proved to be optimal scheduling algorithm for single processor real-time systems and it performs well for distributed systems also. In this paper, we have proposed scheduling algorithms for client/server distributed system with soft timing constraints. The algorithms...
Wireless sensor and actor network (WSAN) is formed by the collaboration of micro-sensor and actor node. Whenever there is any special event i.e., fire, earth quake, flood or enemy attack in the network, sensor nodes have responsibility to sense it and send information towards an actor. The actor node is responsible to take prompt decision and react accordingly. Sensor nodes have limited resources...
EDF (earliest deadline first) has been proved to be optimal scheduling algorithm for single processor real-time system. It also performs well for multiprocessor system. Limitation of EDF is that its performance decreases exponentially when system becomes slightly overloaded. ACO (ant colony optimization) based scheduling algorithm performs well in both underloaded and overloaded conditions. But its...
EDF (earliest deadline first) has been proved to be optimal scheduling algorithm for single processor realtime operating systems when the systems are preemptive and underloaded. The limitation of this algorithm is, its performance decreases exponentially when system becomes slightly overloaded. Authors have already proved ability of ACO (Ant Colony Optimization) based scheduling algorithm for real-time...
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.