A concise manner to send information from agent A to B is to use phrases constructed with the concepts of A: to use the concepts as the atomic tokens to be transmitted. Unfortunate...
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...
Abstract. Often, qualitative values have an ordering, such as (veryshort, short, medium-height, tall) or a hierarchical level, such as (TheWorld, Europe, Spain, Madrid), which are ...
We present an optimization algorithm that combines active learning and locally-weighted regression to find extreme points of noisy and complex functions. We apply our algorithm to...
Abstract. We explore the impact of including hue in a feature construction algorithm for colour target detection. Hue has a long standing record as a good attribute in colour segme...
Giovani Gomez Estrada, Eduardo F. Morales, Huajian...
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
The paper presents a method of automatic enrichment of a very large dictionary of word combinations. The method is based on results of automatic syntactic analysis (parsing) of sen...
Alexander F. Gelbukh, Grigori Sidorov, Sang-Yong H...
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
Motivational attitudes play an important role in investigations into intelligent agents. One of the key problems of representing and reasoning about motivational attitudes is whic...