Sciweavers

557 search results - page 61 / 112
» Useful Transformations in Answer set programming
Sort
View
CAISE
2005
Springer
14 years 1 months ago
Query Processing Using Ontologies
Abstract. Recently, the database and AI research communities have paid increased attention to ontologies. The main motivating reason is that ontologies promise solutions for comple...
Chokri Ben Necib, Johann Christoph Freytag
WEBI
2004
Springer
14 years 1 months ago
Using Semantic Graphs in Clustering Process : Enhance Information Level
In this paper, we particularly focused our attention on how to enhance expressivity of ontologies when used as organized space values in a catalogue request process. Using the Wis...
Jean-Sébastien Brunner, Isabelle Berrien
CEC
2011
IEEE
12 years 8 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
CVPR
2008
IEEE
14 years 10 months ago
A polynomial-time bound for matching and registration with outliers
We present a framework for computing optimal transformations, aligning one point set to another, in the presence of outliers. Example applications include shape matching and regis...
Carl Olsson, Olof Enqvist, Fredrik Kahl
ENTCS
2002
181views more  ENTCS 2002»
13 years 7 months ago
Alias verification for Fortran code optimization
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
Thi Viet Nga Nguyen, François Irigoin