4737 search results - page 835 / 948 » The LOGIC negotiation model |
229
click to vote
PODS
1994
ACM
15 years 11 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
169
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
Merging operators try to define the beliefs of a group of agents according to the beliefs of each member of the group. Several model-based propositional belief merging operators h...
236
click to vote
GPCE
2009
Springer
15 years 10 months ago
2009
Springer
Mapping problem-space features into solution-space features is a fundamental configuration problem in software product line engineering. A configuration problem is defined as g...
202
click to vote
CIKM
2008
Springer
15 years 9 months ago
2008
Springer
We address the problem of academic conference homepage understanding for the Semantic Web. This problem consists of three labeling tasks - labeling conference function pages, func...
222
click to vote
EKAW
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Dealing with heterogeneous ontologies by means of semantic mappings has become an important area of research and a number of systems for discovering mappings between onto...