14161 search results - page 329 / 2833 » On generalized middle-level problem |
143
click to vote
ISAAC
2005
Springer
16 years 5 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 12 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...
179
click to vote
FUN
2010
Springer
15 years 11 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...
148
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
185
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...