Sciweavers

635 search results - page 6 / 127
» Some Computational Problems Related to Pseudo-intents
Sort
View
ML
2000
ACM
103views Machine Learning» more  ML 2000»
14 years 9 months ago
Phase Transitions in Relational Learning
One of the major limitations of relational learning is due to the complexity of verifying hypotheses on examples. In this paper we investigate this task in light of recent publishe...
Attilio Giordana, Lorenza Saitta
ECAI
2008
Springer
14 years 11 months ago
Theoretical and Computational Properties of Preference-based Argumentation
During the last years, argumentation has been gaining increasing interest in modeling different reasoning tasks of an agent. Many recent works have acknowledged the importance of ...
Yannis Dimopoulos, Pavlos Moraitis, Leila Amgoud
CORR
2006
Springer
90views Education» more  CORR 2006»
14 years 9 months ago
The Snowblower Problem
Abstract: We introduce the snowblower problem (SBP), a new optimization problem that is closely related to milling problems and to some material-handling problems. The objective in...
Esther M. Arkin, Michael A. Bender, Joseph S. B. M...
SOFSEM
2004
Springer
15 years 2 months ago
Processing XPath Expressions in Relational Databases
Abstract. Research on processing XML documents gained much activity in recent times. XML query languages are mostly based on XPath expressions, which are used to select parts of XM...
Tadeusz Pankowski
AAAI
1994
14 years 11 months ago
A Computational Market Model for Distributed Configuration Design
This paper presents a precise market model for a well-defined class of distributed configuration design problems. Given a design problem, the model defines a computational economy...
Michael P. Wellman