8825 search results - page 117 / 1765 » All for one or one for all |
102
click to vote
STACS
2010
Springer
15 years 8 months ago
2010
Springer
In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the c...
ICDE
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract— There are many applications in which users interactively access huge tree data by repeating set-based navigations. In this paper, we focus on label-specific/wildcard c...
109
click to vote
DATE
2009
IEEE
15 years 8 months ago
2009
IEEE
—This paper explores the use of dynamic compilation for continuing execution even if one or more of the memory banks used by an application become temporarily unavailable (but th...
111
click to vote
CPAIOR
2009
Springer
15 years 8 months ago
2009
Springer
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
ICANN
2009
Springer
15 years 7 months ago
2009
Springer
This paper presents an application of multiple kernels like Kernel Basis to the Relevance Vector Machine algorithm. The framework of kernel machines has been a source of many works...