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.
In order to improve the trustworthiness of network and decrease the cheating behavior among the nodes in the network, a model for trust discovery based on weighted closeness (WCTD) is presented. This model considers the factors such as the transition fading, time decay, and weights of the path and so on when performing the trust path searching and choosing. So trustor can find the node which satisfies...
With the development of grid computing, economy models are invented and increasingly applied, however, that is under the assumption of both transaction parties are honest and trustworthy. In reality there is serious information asymmetry between the transaction participators. Information asymmetry may cause resource providers opportunistically exploit the information gap for resource consumers on...
Optimized drilling technology is the classical one that it is the necessary links to realize the scientific drilling. Whereas, drilling engineering is a complex system because of the plentiful uncertain random information which occurs during the drilling process. The optimizing problem has to become more complex and uncertain because of the complexity of the drilling engineering. It is imperious to...
In this paper, a filter and fan method is proposed for the single-machine tardiness scheduling problem with sequence-dependent setups, which is a typical NP-hard combinational optimization problem. The method searches the solution space by means of neighborhood search tree and the tree branches are extended by predefined moves. To enhance the algorithm ability of escaping from local optima, kick strategy...
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.