Sciweavers

297 search results - page 49 / 60
» et 2002
Sort
View
LREC
2010
192views Education» more  LREC 2010»
13 years 11 months ago
Testing Semantic Similarity Measures for Extracting Synonyms from a Corpus
The definition of lexical semantic similarity measures has been the subject of lots of works for many years. In this article, we focus more specifically on distributional semantic...
Olivier Ferret
ICGA
2006
128views Optimization» more  ICGA 2006»
13 years 9 months ago
Never-Ending Moves in Bao
Bao is a member of the large family of mancala games. It is generally considered to be the most complex mancala game with respect to the number of game rules (Townshend, 1986; De ...
Tom Kronenburg, H. H. L. M. Donkers, Alex J. de Vo...
TALG
2008
67views more  TALG 2008»
13 years 9 months ago
Structure and linear-time recognition of 4-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Andreas Brandstädt, Van Bang Le, R. Sritharan
AI
2002
Springer
13 years 9 months ago
On the computational complexity of assumption-based argumentation for default reasoning
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
ALGORITHMICA
2002
84views more  ALGORITHMICA 2002»
13 years 9 months ago
Exploring Unknown Environments with Obstacles
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the rst problem setting we cons...
Susanne Albers, Klaus Kursawe, Sven Schuierer