Sciweavers

6562 search results - page 1068 / 1313
» Noetherianity and Combination Problems
Sort
View
ESWS
2008
Springer
15 years 8 months ago
Forgetting Concepts in DL-Lite
To support the reuse and combination of ontologies in Semantic Web applications, it is often necessary to obtain smaller ontologies from existing larger ontologies. In particular, ...
Zhe Wang, Kewen Wang, Rodney W. Topor, Jeff Z. Pan
EWCBR
2008
Springer
15 years 8 months ago
Competence-Preserving Case-Deletion Strategy for Case Base Maintenance
The main goal of a Case-Based Reasoning (CBR) system is to provide criteria for evaluating the internal behavior and task efficiency of a particular system for a given initial case...
Mohamed Karim Haouchine, Brigitte Chebel-Morello, ...
EWCBR
2008
Springer
15 years 8 months ago
Discovering Feature Weights for Feature-based Indexing of Q-tables
In this paper we propose an approach to address the old problem of identifying the feature conditions under which a gaming strategy can be effective. For doing this, we will build ...
Chad Hogg, Stephen Lee-Urban, Bryan Auslander, H&e...
ATMOS
2007
163views Optimization» more  ATMOS 2007»
15 years 8 months ago
Branching Strategies to Improve Regularity of Crew Schedules in Ex-Urban Public Transit
We discuss timetables in ex-urban bus traffic that consist of many trips serviced every day together with some exceptions that do not repeat daily. Traditional optimization methods...
Ingmar Steinzen, Leena Suhl, Natalia Kliewer
ACL
2008
15 years 8 months ago
A Re-examination of Query Expansion Using Lexical Resources
Query expansion is an effective technique to improve the performance of information retrieval systems. Although hand-crafted lexical resources, such as WordNet, could provide more...
Hui Fang
« Prev « First page 1068 / 1313 Last » Next »