1813 search results - page 212 / 363 » Instance Pruning Techniques |
166
click to vote
ANTSW
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
135
click to vote
ASIAN
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In a process calculus, an agent guarantees responsive usage of a channel name r if a communication along r is guaranteed to eventually take place. Responsiveness is impor...
177
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper we introduce a complex allocation and scheduling problem for variable voltage Multi-Processor System-on-Chip (MPSoC) platforms. We propose a methodology to ...
161
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Label ranking studies the problem of learning a mapping from instances to rankings over a predefined set of labels. We approach this setting from a case-based perspective and propo...
169
click to vote
DNA
2000
Springer
15 years 10 months ago
2000
Springer
We present a randomized DNA algorithm for k-SAT based on the classical algorithm of Paturi et al. [8]. For an n-variable, m-clause instance of k-SAT (m > n), our algorithm finds...