Sciweavers

7773 search results - page 1214 / 1555
» On generalized Frame-Stewart numbers
Sort
View
DC
2010
15 years 7 months ago
Model checking transactional memories
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh
BMCBI
2006
106views more  BMCBI 2006»
15 years 6 months ago
Methodological study of affine transformations of gene expression data with proposed robust non-parametric multi-dimensional nor
Background: Low-level processing and normalization of microarray data are most important steps in microarray analysis, which have profound impact on downstream analysis. Multiple ...
Henrik Bengtsson, Ola Hössjer
BMCBI
2006
154views more  BMCBI 2006»
15 years 6 months ago
Analysis with respect to instrumental variables for the exploration of microarray data structures
Background: Evaluating the importance of the different sources of variations is essential in microarray data experiments. Complex experimental designs generally include various fa...
Florent Baty, Michaël Facompré, Jan Wi...
KAIS
2008
114views more  KAIS 2008»
15 years 6 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong
MP
2006
138views more  MP 2006»
15 years 6 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...
« Prev « First page 1214 / 1555 Last » Next »