Sciweavers

11214 search results - page 2009 / 2243
» Just-in-time data structures
Sort
View
ENC
2006
IEEE
15 years 3 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 3 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
FPL
2006
Springer
125views Hardware» more  FPL 2006»
15 years 3 months ago
Application-Specific Memory Interleaving for FPGA-Based Grid Computations: A General Design Technique
Many compute-intensive applications generate single result values by accessing clusters of nearby points in grids of one, two, or more dimensions. Often, the performance of FGPA i...
Tom Van Court, Martin C. Herbordt
GECCO
2006
Springer
124views Optimization» more  GECCO 2006»
15 years 3 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 3 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 2009 / 2243 Last » Next »