Sciweavers

2529 search results - page 417 / 506
» The Logical Structure of Binding
Sort
View
DLOG
2001
14 years 11 months ago
Using Lazy Unfolding for the Computation of Least Common Subsumers
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
Anni-Yasmin Turhan, Ralf Molitor
CATA
2003
14 years 11 months ago
A Genetic Algorithm Approach to Static Task Scheduling in a Reconfigurable Hardware Environment
This paper presents a basic framework for applying static task scheduling techniques to arbitrarily-structured task systems whose targeted execution environment is comprised of fi...
Sin Ming Loo, B. Earl Wells, J. D. Winningham
IJCAI
2003
14 years 11 months ago
Spaces of Theories with Ideal Refinement Operators
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
Nicola Fanizzi, Stefano Ferilli, Nicola Di Mauro, ...
CASCON
1996
148views Education» more  CASCON 1996»
14 years 11 months ago
Reuse in the application layer
Today's advanced CASE tools, combining the building-block and generative approaches to software reuse, are effective for reuse of software components and procedures in the pr...
Hirotomo Okuno, Hideki Matsumoto, Hironori Asai, M...
BMCBI
2010
149views more  BMCBI 2010»
14 years 10 months ago
S3DB core: a framework for RDF generation and management in bioinformatics infrastructures
Background: Biomedical research is set to greatly benefit from the use of semantic web technologies in the design of computational infrastructure. However, beyond well defined res...
Jonas S. Almeida, Helena F. Deus, Wolfgang Maass