Sciweavers

1190 search results - page 98 / 238
» Enhancing Sharing for Precision
Sort
View
CPM
2000
Springer
136views Combinatorics» more  CPM 2000»
15 years 9 months ago
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo ...
ECAI
2000
Springer
15 years 9 months ago
The Emergence of Grammar in Communicating Autonomous Robotic Agents
Abstract. Over the past five years, the topic of the origins of language is gaining prominence as one of the big unresolved questions of cognitive science. Artificial Intelligenc...
Luc Steels
142
Voted
ATAL
2006
Springer
15 years 8 months ago
Robust mechanisms for information elicitation
We study information elicitation mechanisms in which a principal agent attempts to elicit the private information of other agents using a carefully selected payment scheme based o...
Aviv Zohar, Jeffrey S. Rosenschein
113
Voted
EMNLP
2007
15 years 6 months ago
Generating Lexical Analogies Using Dependency Relations
A lexical analogy is a pair of word-pairs that share a similar semantic relation. Lexical analogies occur frequently in text and are useful in various natural language processing ...
Andy Chiu, Pascal Poupart, Chrysanne DiMarco
EUMAS
2006
15 years 6 months ago
Using Cooperative Agent Negotiation for Ontology Mapping
Well-known approaches for the ontology mapping can be grouped into lexical, semantic, and structural ones. We assume that the approaches are complementary to each other and their ...
Cássia Trojahn dos Santos, Márcia Cr...