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 solution of NP-hard problems requires the use of one or more explicit or implicit heuristics as a practical measure. Quantum computers promise to make this practical for O (2n) problems or less, but have yet to deliver a solution to a single NP-hard problem. The question addressed by this paper is whether domain transference and reuse of problem-solving knowledge can be mediated through the reuse...
The semantic mapping in Distributed Dynamic Description Logic (D3L) is an extension of Dynamic Description Logic (DDL), which makes it easy to deal with distributed and heterogeneous situation. Existing work on knowledge propagation in D3L is just studied for simple cases, in which only two DDL systems are considered. By using the compositional consistency theory, D3L makes the knowledge propagate...
Charisma is a higher-level notation for writing parallel static data flow programs. It provides a convenient publish-consume paradigm for the expression of static flows of data and control. Although the syntax of the language allows the elegant expression of an important class of programs, it is restrictive, in that not all types of static data flow program can be written in Charisma. In this paper,...
We consider the class of o-minimally definable hybrid automata with a bounded discrete-transition horizon. We show that for every hybrid automata in this class, there exists a bisimulation of finite index, and that the bisimulation quotient can be effectively constructed when the underlying o-minimal theory is decidable. More importantly, we give natural specifications for hybrid automata which ensure...
To improve the first word dictionary with hash structure and the reverse maximum matching segmentation algorithm, the last word dictionary based on Hash structure which records word length is designed. By utilizing the reverse maximum matching methods, it realizes the intended objective of improving the speed and reducing the ambiguities rate of word segmentation. This essay explains the design principle...
Research on similarity methodology of dynamic tracing disciplinary themes based on improved similarity algorithm is the improvement and perfection of current similarity methodology based on co-word analysis, and also is good supplement to the mapping method of dynamic tracing disciplinary themes based on co-word analysis. Three algorithms of similarity methodology have common shortcoming that lacking...
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.