Sciweavers

877 search results - page 22 / 176
» How to Cover a Grammar
Sort
View
JWSR
2007
89views more  JWSR 2007»
13 years 7 months ago
Fully Automated Web Services Discovery and Composition Through Concept Covering and Concept Abduction
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
JSYML
2010
81views more  JSYML 2010»
13 years 2 months ago
Groupoids, covers, and 3-uniqueness in stable theories
Abstract. Building on Hrushovski's work in [5], we study definable groupoids in stable theories and their relationship with 3-uniqueness and finite internal covers. We introdu...
John Goodrick, Alexei Kolesnikov
CIAC
2006
Springer
278views Algorithms» more  CIAC 2006»
13 years 11 months ago
Covering a Set of Points with a Minimum Number of Lines
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
Magdalene Grantson, Christos Levcopoulos
ISCI
2011
13 years 2 months ago
Sequential covering rule induction algorithm for variable consistency rough set approaches
We present a general rule induction algorithm based on sequential covering, suitable for variable consistency rough set approaches. This algorithm, called VC-DomLEM, can be used f...
Jerzy Blaszczynski, Roman Slowinski, Marcin Szelag
ICSE
2003
IEEE-ACM
14 years 7 months ago
Component Technology - What, Where, and How?
Software components, if usedproperly, ofj~r many software engineering benefits. Yet, they also pose many original challenges starting fi'om quality assurance and ranging to a...
Clemens A. Szyperski