8413 search results - page 225 / 1683 » Ordering Problem Subgoals |
ISAAC
2005
Springer
15 years 6 months 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...
109
Voted
FUN
2010
Springer
15 years 5 months ago
2010
Springer
In the classic Josephus problem, elements 1, 2, . . . , n are placed in order around a circle and a skip value k is chosen. The problem proceeds in n rounds, where each round consi...
114
Voted
EVOW
2007
Springer
15 years 4 months ago
2007
Springer
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
135
click to vote
GECCO
2006
Springer
15 years 4 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...
114
click to vote
IJCAI
1989
15 years 1 months ago
1989
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de sign task takes as input the specifications of the desired functions of a device...