AICOM
2015
8 years 2 months ago
2015
The task of determining labels of all network nodes based on the knowledge about network structure and labels of some training subset of nodes is called the within-network classi...
AICOM
2015
8 years 2 months ago
2015
In the Canadian Traveler Problem (CTP) a traveling agent is given a weighted graph, where some of the edges may be blocked, with a known probability. The agent needs to travel to ...
AICOM
2015
8 years 2 months ago
2015
The oral communication competence is defined on the top of the most relevant skills for one’s professional and personal life. Because of the importance of communication in our a...
AICOM
2015
8 years 2 months ago
2015
This paper introduces a new kind of local consistency based on the general idea of singleton arc consistency (SAC). This is a reduced form of SAC that only considers neighbourhoods...
AICOM
2015
8 years 2 months ago
2015
If a set of agents tries to reach an agreement, there will exist an Agreement Space that models the maximum valid space according to the individual constraints of each agent, regar...
AICOM
2015
8 years 2 months ago
2015
Many problems that we face nowadays can be expressed as optimization problems. Finding the best solution for real-world instances of such problems is hard or even infeasible. Metah...
AICOM
2015
8 years 2 months ago
2015
We consider the class of planning and sequential decision making problems where the state space has continuous components, but the available actions come from a discrete set, and ...
AICOM
2015
8 years 2 months ago
2015
Abstract. In abstract argumentation, the directionality principle conveys the intuition that, for an unattacked set, the choice of arguments that are part of an extension should on...
AICOM
2015
8 years 2 months ago
2015
In this paper the authors propose a new closed contour descriptor that could be seen as a Feature Extractor of closed contours based on the Discrete Hartley Transform (DHT), its ma...
AICOM
2015
8 years 2 months ago
2015
The problem of propositional satisfiability (SAT) has found a number of applications in both theoretical and practical computer science. In many applications, however, knowing a ...