Sciweavers

1994 search results - page 253 / 399
» Computation of Optical Flow Using Dynamic Programming
Sort
View
WCET
2010
14 years 7 months ago
Precomputing Memory Locations for Parametric Allocations
Current worst-case execution time (WCET) analyses do not support programs using dynamic memory allocation. This is mainly due to the unpredictability of cache performance introduc...
Jörg Herter, Sebastian Altmeyer
CBMS
2008
IEEE
14 years 11 months ago
Generating GO Slim Using Relational Database Management Systems to Support Proteomics Analysis
The Gene Ontology Consortium built the Gene Ontology database (GO) to address the need for a common standard in naming genes and gene products. Using different names for the same ...
Getiria Onsongo, Hongwei Xie, Timothy J. Griffin, ...
KES
1999
Springer
15 years 2 months ago
Dynamic Demes parallel genetic algorithm
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
Mariusz Nowostawski, Riccardo Poli
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
14 years 1 months ago
Schema evolution analysis for embedded databases
—Dynamic software updating research efforts have mostly been focused on updating application code and in-memory state. As more and more applications use embedded databases for st...
Shengfeng Wu, Iulian Neamtiu
GI
2009
Springer
15 years 2 months ago
Massively-Parallel Simulation of Biochemical Systems
: Understanding biological evolution prompts for a detailed understanding of the realized phenotype. Biochemical and gene regulatory dynamics are a cornerstone for the physiology o...
Jens Ackermann, Paul Baecher, Thorsten Franzel, Mi...