Sciweavers

12453 search results - page 2217 / 2491
» Concurrent Data Structures
Sort
View
EKAW
2006
Springer
15 years 10 months ago
Matching Unstructured Vocabularies Using a Background Ontology
Existing ontology matching algorithms use a combination of lexical and structural correspondance between source and target ontologies. We present a realistic case-study where both ...
Zharko Aleksovski, Michel C. A. Klein, Warner ten ...
ENC
2006
IEEE
15 years 10 months ago
Adaptive Node Refinement Collocation Method for Partial Differential Equations
In this work, by using the local node refinement technique purposed in [2, 1], and a quad-tree type algorithm [3, 13], we built a global refinement technique for Kansa's unsy...
José Antonio Muñoz-Gómez, Ped...
ESOP
2006
Springer
15 years 10 months ago
A Typed Assembly Language for Confidentiality
Language-based information-flow analysis is promising in protecting data confidentiality. Although much work has been carried out in this area, relatively little has been done for ...
Dachuan Yu, Nayeem Islam
129
Voted
GECCO
2006
Springer
124views Optimization» more  GECCO 2006»
15 years 10 months ago
Genetic programming for human oral bioavailability of drugs
Automatically assessing the value of bioavailability from the chemical structure of a molecule is a very important issue in biomedicine and pharmacology. In this paper, we present...
Francesco Archetti, Stefano Lanzeni, Enza Messina,...
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
15 years 10 months ago
Identification of weak motifs in multiple biological sequences using genetic algorithm
Recognition of motifs in multiple unaligned sequences provides an insight into protein structure and function. The task of discovering these motifs is very challenging because mos...
Topon Kumar Paul, Hitoshi Iba
« Prev « First page 2217 / 2491 Last » Next »