Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
Current search engines cannot effectively rank those relational data, which exists on dynamic websites supported by online databases. In this study, to rank such structured data, ...
Planning as satisfiability is a principal approach to planning with many eminent advantages. The existing planning as satisfiability techniques usually use encodings compiled from...
A case-based reasoner can frequently benefit from using pieces of multiple previous cases in the course of solving a single problem. In our model, case pieces, called snippets, ar...
This paper describes the methodology of an intelligent agent for building a self-adaptive course on the Web. An important task, therefore, is to combine adaptability with the lear...
Mohammed Abdel Razek, Claude Frasson, Marc Kaltenb...