In this paper, we propose a technique to flexibly implement genetic algorithms for various problems on FPGAs. For the purpose, we propose a basic architecture for GA which consist...
There is a need for agent systems that can scale to realworld applications, yet retain the clean semantic underpinning of more formal agent frameworks. We describe the SRI Procedu...
Abstract. Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had...
Ontology mapping is to find semantic correspondences between similar elements of different ontologies. It is critical to achieve semantic interoperability in the WWW. This paper su...
In this paper, we propose a new language-independent representation of adhoc constraints, called a box constraint collection. Using constructive disjunction, this representation ac...