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.
This study concerns output consensus problems of linear multi-agent systems with fixed topologies and agents described by homogeneous or heterogeneous linear systems. Based on generalized inverse, graph and linear system theory, conditions are investigated for output consensusability with respect to a set of admissible consensus protocols. The given output consensus conditions depend on both topologies...
Based on probability, the paper recommends a new inference method for validating the trusted forensics. Using graph theory, the original data is formalized to abstract data, and is shown as some nodes in the graph. The operation actions and the forensics methods are abstracted to the edge sets. With these, and using probability theory, the probability of each node is calculated as its credence. With...
Resource discovery is a crucial problem in grid environments. This paper introduces a multi-agent based resource discovery model. On the basis of local resource's adopting the strategy "first come first served" to the task, we put forward a resource management heuristic algorithm using a technique of resource advertisement and discovery. Agents are organized into a graph and the heuristic...
We describe a heuristic method for solving the minimum makespan problem of job shop scheduling. It makes use of the disjunctive graph, and set the direction of the disjunctive arcs as decision variables. The decision variables, as micro bottlenecks, are cleared one by one, following the critical path algorithm. Once a new disjunctive arc is adopted all the implicit disjunctive arcs will be decided...
With the increasing requirements of computing in a variety of fields, high performance computing has been becoming more and more popular. However, user environment of parallel computing is a bottleneck with the fast advancement of computer technology. To design and implement a convenient parallel programming platform for Windows environment to satisfy users, especially non-professional users, a parallel...
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.