Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of th...
The ambiguity of person names in the Web has become a new area of interest for NLP researchers. This challenging problem has been formulated as the task of clustering Web search r...
This paper describes a new simple operator for Evolutionary Algorithms (EA) to climb ridged landscapes. Categories and Subject Descriptors: I.2.8 [Computing Methodologies]: Proble...
Probabilistic data is coming as a new deluge along with the technical advances on geographical tracking, multimedia processing, sensor network and RFID. While similarity search is...
In this paper we address the problem of agents engaged in a distributed costly two-sided search for pairwise partnerships in Multi-Agent Systems (MAS). While traditional two-sided...