Sciweavers

9842 search results - page 1483 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ICGI
2004
Springer
16 years 11 days ago
The Omphalos Context-Free Grammar Learning Competition
This paper describes the Omphalos Context-Free Grammar Learning Competition held as part of the International Colloquium on Grammatical Inference 2004. The competition was created ...
Bradford Starkie, François Coste, Menno van...
ICSR
2004
Springer
16 years 11 days ago
Developing Active Help for Framework Instantiation Through Case-Based Reasoning
Object-oriented frameworks are sophisticated software artifacts that significantly impact productivity when building applications in a given domain. However, frameworks are complex...
Carlos Fernández-Conde, Pedro A. Gonz&aacut...
ICSR
2004
Springer
16 years 11 days ago
A Metamodel-Based Approach for the Dynamic Reconfiguration of Component-Based Software
Non-stop and highly available applications need to be dynamically adapted to new conditions in their execution environment, to new user requirements or to some situations usually u...
Abdelmadjid Ketfi, Noureddine Belkhatir
ILP
2004
Springer
16 years 11 days ago
On the Effect of Caching in Recursive Theory Learning
This paper focuses on inductive learning of recursive logical theories from a set of examples. This is a complex task where the learning of one predicate definition should be inter...
Margherita Berardi, Antonio Varlaro, Donato Malerb...
INEX
2004
Springer
16 years 11 days ago
Narrowed Extended XPath I (NEXI)
INEX has through the years provided two types of queries: Content-Only queries (CO) and Content-And-Structure queries (CAS). The CO language has not changed much, but the CAS lang...
Andrew Trotman, Börkur Sigurbjörnsson
« Prev « First page 1483 / 1969 Last » Next »