11740 search results - page 225 / 2348 » More Problems in Rewriting |
141
click to vote
ISAAC
2005
Springer
16 years 1 days ago
2005
Springer
Given a sequence of n real numbers and an integer k, 1 k 1 2 n(n − 1), the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all poss...
200
click to vote
SAC
2003
ACM
15 years 11 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
199
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
181
click to vote
ESANN
2004
15 years 8 months ago
2004
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
200
click to vote
CONSTRAINTS
2010
15 years 6 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...