1977 search results - page 247 / 396 » The satisfactory partition problem |
136
click to vote
WOB
2003
15 years 5 months ago
2003
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
136
click to vote
INFORMATICALT
2008
15 years 4 months ago
2008
This paper studies an adaptive clustering problem. We focus on re-clustering an object set, previously clustered, when the feature set characterizing the objects increases. We prop...
166
click to vote
PR
2008
15 years 4 months ago
2008
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with ...
113
click to vote
PRL
2006
15 years 4 months ago
2006
This paper presents a novel camera network design methodology based on the Parisian evolutionary computation approach. This methodology proposes to partition the original problem ...
126
click to vote
SIAMDM
2010
15 years 2 months ago
2010
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-...