Sciweavers

994 search results - page 30 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
ICCD
2005
IEEE
246views Hardware» more  ICCD 2005»
14 years 5 months ago
H-SIMD Machine: Configurable Parallel Computing for Matrix Multiplication
FPGAs (Field-Programmable Gate Arrays) are often used as coprocessors to boost the performance of dataintensive applications [1, 2]. However, mapping algorithms onto multimillion-...
Xizhen Xu, Sotirios G. Ziavras
ASSETS
2010
ACM
13 years 4 months ago
Broadening accessibility through special interests: a new approach for software customization
Individuals diagnosed with autism spectrum disorder (ASD) often fixate on narrow, restricted interests. These interests can be highly motivating, but they can also create attentio...
Robert R. Morris, Connor R. Kirschbaum, Rosalind W...
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 8 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
HPDC
2003
IEEE
14 years 2 months ago
Using Views for Customizing Reusable Components in Component-Based Frameworks
Increasingly, scalable distributed applications are being constructed by integrating reusable components spanning multiple administrative domains. Dynamic composition and deployme...
Anca-Andreea Ivan, Vijay Karamcheti
MP
1998
105views more  MP 1998»
13 years 8 months ago
Capacitated facility location: Separation algorithms and computational experience
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
Karen Aardal