Sciweavers

406 search results - page 54 / 82
» Boosting Using Branching Programs
Sort
View
INFORMS
2010
138views more  INFORMS 2010»
13 years 7 months ago
Pruning Moves
The concept of dominance among nodes of a branch-decision tree, although known since a long time, is not exploited by general-purpose Mixed-Integer Linear Programming (MILP) enume...
Matteo Fischetti, Domenico Salvagnin
CDES
2008
123views Hardware» more  CDES 2008»
13 years 10 months ago
R-tree: A Hardware Implementation
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
Xiang Xiao, Tuo Shi, Pranav Vaidya, Jaehwan John L...
CSB
2005
IEEE
145views Bioinformatics» more  CSB 2005»
14 years 2 months ago
Classification Methods for HIV-1 Medicated Neuronal Damage
HIV-1-associated dementia (HAD) is the most devastating disease happened in the central nervous system of AIDS patients. Neuronal damage, the early indicator of HAD, under differe...
Mengjun Wang, Jialin Zheng, Zhengxin Chen, Yong Sh...
ASPLOS
2010
ACM
14 years 3 months ago
MacroSS: macro-SIMDization of streaming applications
SIMD (Single Instruction, Multiple Data) engines are an essential part of the processors in various computing markets, from servers to the embedded domain. Although SIMD-enabled a...
Amir Hormati, Yoonseo Choi, Mark Woh, Manjunath Ku...
ISSTA
2009
ACM
14 years 3 months ago
Precise pointer reasoning for dynamic test generation
Dynamic test generation consists of executing a program while gathering symbolic constraints on inputs from predicates encountered in branch statements, and of using a constraint ...
Bassem Elkarablieh, Patrice Godefroid, Michael Y. ...