2489 search results - page 20 / 498 » On the Subgroup Distance Problem |
ENTCS
2002
13 years 7 months ago
2002
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
ANOR
2002
13 years 7 months ago
2002
Classical approaches to location problems are based on the minimization of the average distance (the median concept) or the minimization of the maximum distance (the center concept...
CEC
2008
IEEE
14 years 1 months ago
2008
IEEE
— In this paper, three new methods for pushing solutions toward a desired region of the objective space more quickly are explored; hypercube distance scaling, dynamic objective t...
IJHCI
2006
13 years 7 months ago
2006
Severity assessments enable prioritization of problems encountered during usability evaluations and thereby provide a device for guiding the utilization of design resources. Howeve...
INFORMATICALT
2007
13 years 7 months ago
2007
The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are ...