4617 search results - page 593 / 924 » Automation of Diagrammatic Reasoning |
204
Voted
CSL
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
217
click to vote
DEON
2006
Springer
15 years 11 months ago
2006
Springer
In this paper we extend earlier work on deontic deadlines in CTL to the framework of alternating time temporal logic (ATL). The resulting setting enables us to model several concep...
179
Voted
EWCBR
2006
Springer
15 years 11 months ago
2006
Springer
The complexity and high construction cost of case bases make it very difficult, if not impossible, to evaluate a CBR system, especially a knowledge-intensive CBR system, using stat...
229
click to vote
EWCBR
2006
Springer
15 years 11 months ago
2006
Springer
Feature selection for unsupervised tasks is particularly challenging, especially when dealing with text data. The increase in online documents and email communication creates a nee...
227
Voted
EWCBR
2006
Springer
15 years 11 months ago
2006
Springer
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...