994 search results - page 51 / 199 » Custom Computing Machines for the Set Covering Problem |
118
Voted
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
The increasing gap between processor and memory performance has led to new architectural models for memory-intensive applications. In this paper, we use a set of memory-intensive ...
105
Voted
ENDM
2010
15 years 25 days ago
2010
We propose a 0/1 integer programming model to tackle the office space allocation (OSA) problem which refers to assigning room space to a set of entities (people, machines, roles, ...
98
Voted
JUCS
2010
14 years 7 months ago
2010
: We consider the uniform BSS model of computation where the machines can perform additions, multiplications, and tests of the form x 0. The oracle machines can also check whether...
127
Voted
KSEM
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
125
click to vote
MFCS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....