2489 search results - page 117 / 498 » On the Subgroup Distance Problem |
138
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
In this paper we propose a novel iterative search procedure for multi-objective optimization problems. The iteration process – though derivative free – utilizes the geometry o...
111
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
— Addressing dynamic optimization problems has attracted a growing interest from the evolutionary algorithm community in recent years due to its importance in the applications of...
127
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
123
click to vote
ICALT
2003
IEEE
15 years 9 months ago
2003
IEEE
It is believed that computer-supported collaboration at a distance can stimulate learning. In this paper an innovative environment that permits real-time collaborative problem sol...
134
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...