994 search results - page 50 / 199 » Custom Computing Machines for the Set Covering Problem |
101
Voted
ESSMAC
2003
Springer
15 years 6 months ago
2003
Springer
Kernel-based non-parametric models have been applied widely over recent years. However, the associated computational complexity imposes limitations on the applicability of those me...
HM
2007
Springer
15 years 7 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
116
Voted
PARA
1995
Springer
15 years 4 months ago
1995
Springer
This paper describes a proposal for a set of Parallel Basic Linear Algebra Subprograms PBLAS . The PBLAS are targeted at distributed vector-vector, matrix-vector and matrixmatrix...
113
click to vote
SIGUCCS
2003
ACM
15 years 6 months ago
2003
ACM
IAT Services, the central Information Technology group at the University of Missouri-Columbia, operates computing sites in general access, classroom, and residence hall settings. ...
119
click to vote
COCO
2004
Springer
15 years 4 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...