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 this paper, a genetic algorithm and a tabu search are investigated for the maximum satisfiability problem. When the evolutionary algorithm is hybridized with the randomized procedure G-bit [14], better performance is achieved and it even outperforms the well known probabilistic procedure GSAT[25]. On the other hand, when the random noise strategy is introduced in the tabu search, the latter competes...
The c urrent world wide web is featured by a huge volume of knowledge, making it possible to apply knowledge mining to extract meta-knowledge. This paper explores this possibility and considers knowledge discovery process acceleration. Given that knowledge is extracted from data, knowledge mining process would be similar to data mining. However, knowledge representation is more complex than data representation...
The effectiveness and the robustness of the existing association rule mining algorithms provides a huge number of high quality rules that the user can not understand. Consequently, thinking about another representation of the generated rules becomes vital task. For this, the present paper explores meta-rules discovery. It focuses on clustering association rules for large data sets. This allows the...
This paper deals with Association Rules Mining algorithms for very large databases and especially for those existing on the web. The numerous polynomial exact algorithms already proposed in literature treated somehow in an efficient way data sets with reasonable size. However they are not capable to cope with a huge amount of data in the web context where the respond time must be very short. This...
DNA cryptography is a new promising direction in cryptography research that emerged with the progress in DNA computing field. DNA can be used not only to store and transmit information, but also to perform computations. The massive parallelism and extraordinary information density inherent in this molecule are exploited for cryptographic purposes, and several DNA based algorithms are proposed for...
Tasks scheduling is one of the most important challenges in embedded hard-real-time systems. The problem is known to be NP-Hard and exhaustive search algorithms have no significant benefit in large-scale context. This paper proposes a scatter search based approach for mono-processor systems with timing, precedence and exclusion constraints with no preemption. An empirical study is undertaken and comparison...
In the vehicle management systems, two important issues have to be considered by managers: the dispatching problem with the aim of minimizing the response time for current emergency calls; and the covering problem with the objective of keeping proper coverage to satisfy future calls in best times. The purpose of this paper is to investigate the value, in term of service quality, of integrating the...
In this paper we describe a new hybrid evolutionary algorithm and its implementation for the NP hard exam timetabling problem. This approach uses the good features of the Greedy Randomized Adaptive Search Procedure (GRASP) and the evolutionary Scatter Search (SS) approach which uses strategies for search diversification and intensification to maintain and evolve a population of solutions. New solutions...
In this paper, we propose three DNA algorithms for the weighted maximum satisfiability problem (MAX-W-SAT for short). The first one is an extension of Lipton's algorithm for SAT. The space solution is represented by a graph and the weights are encoded in form of pieces which are appended to the double strands representing the solutions. The second algorithm proposes a different encoding of information...
This paper deals with large scale information retrieval aiming at contributing to web searching. The collections of documents considered are huge and not obvious to tackle with classical approaches. The greater the number of documents belonging to the collection, the more powerful approach required. A Bees Swarm Optimization algorithm called BSO-IR is designed to explore the prohibitive number of...
When using usual segmentation algorithms we have problems in segmenting some handwritten characters like the letters `u' and `w' in Script Latin and U and U in Arabic. To overcome these problems we decided to correct some segmentation problems after the rejection or the ambiguousness decision of the recognition system for certain entries. Indeed, the major rejection problems are coming from errors...
This paper presents two ACO algorithms for information retrieval. Unlike existing works, the proposed algorithms address the problem for large scale data sets. The algorithms and a classical information retrieval method have been implemented for comparison purposes. Experimentations have been conducted on smart collections and random benchmarks. Numerical results show that for small collections of...
Information retrieval (IR) has been widely investigated these last decades and significant results have been applied to several domains like e-commerce, e-library and automatic medical diagnostics. However, very few studies in this area deal with artificial intelligence or AI tools. Knowing the power of meta-heuristics in problem solving, we suggest exploring information retrieval with an evolutionary...
Artificial intelligence tools are seldom used for information retrieval since classical approaches have addressed this problem in an efficient way. For large scale information retrieval, the situation is different and may necessitate more powerful methodologies. In this paper we show that indeed for large scale collections, heuristic search techniques outperform the conventional approaches in addressing...
This paper presents a meta-heuristic approach, namely, the ant colony system for non-preemptive scheduling of real-time tasks under timing and precedence constraints on a single processor architecture. The present paper expresses a solution to escape the stagnation situations well known in ant colonies based methods. The idea behind our solution is to add a new information to the transition rule so...
The process of designing a parallel data warehouse has two main steps: (1) fragmentation and (2) allocation of generated fragments at various nodes. Usually, fragmentation and allocation tasks are used iteratively (we first split the warehouse horizontally and then allocate fragments over the nodes). The main drawback of such design approach (called iterative) is that it does not take into account...
This paper presents a new parallel evolutionary approach where the concept of generation has been removed and replaced by the cycle one. Indeed, the classical genetic algorithms (GAs) deals with operations on the whole population through all generations. These operations are performed during the evolution towards the best individual or solution of the considered combinatorial problem. In our approach,...
The interaction between agents is more than one simple messages exchange: one of the interaction aspects shows a conversation based on a shared and officially agreed messages exchange. The conversations between agents in the multi agents systems (MAS) are often structured according to typical diagrams called interaction protocols. The interaction protocols aspects differ according to the type of the...
Recently, advances in mobile computing development have renewed the interest in the transaction techniques, in particular atomic commit protocols (ACPs). In this study, we propose a simulation platform for mobile distributed transaction systems and use it to compare the performances of a set of mobile ACPs. The results demonstrate the necessity of evaluating the protocols and techniques on a system...
Implementation of intrusion detection systems with agent technology is one of the new paradigms for intrusion detection for computer systems. In this paper, we propose a distributed intrusion detection framework based on autonomous and mobile agents. In this framework, the mobile agent platform "aglets" is utilized. The system has five types of agents: administrator agents, analyzer agents,...
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.