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.
It is well known that reasoning with AI temporal projection problems is difficult. Determining the Possible Truth problem, a basic temporal projection decision problem, in the so-called Simple Event System remains NP-complete. In this paper, two types of constraints, on the graph-theoretic representation of the cause-and-effect relationships between events and on the partial orders of events, are...
Open shortest path first (OSPF) is the most commonly used intra-domain Internet routing protocol. As the routes of paths are determined by basically only the link metrics, many paths may pass a link with small metric; therefore, there is high possibility that it causes the congestion of the link. It is essential that the number of the paths with large traffic in a link is limited to avoid a congestion;...
Anycast communication is a new Internet service defined in IPv6, and it can make a host communication with the one ldquonearestrdquo member in a group of servers. The anycast routing problem with multiple QoS constrained is known to be NP-complete problem and we can't get satisfying results when using the precise method in polynomial time. In this paper, a QoS anycast routing algorithm based on ant...
We propose a subclass of timed game automata (TGA), called task TGA, representing networks of communicating tasks where the system can choose when to start the task and the environment can choose the duration of the task. We search to solve finite-horizon reachability games on task TGA by building strategies in the form of simple temporal networks with uncertainty (STNU). Such strategies have the...
Endowing mesh routers with multiple radios is a recent solution to improve the performance of wireless mesh networks. The consequent problem to assign channels to radios has been recently investigated and its relation to the routing problem has been revealed. The joint channel assignment and routing problem has been shown to be NP-complete and hence mainly heuristics have been proposed. However, such...
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.