2681 search results - page 171 / 537 » Problem F |
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
Niching techniques play an important role in evolutionary algorithms. Existing niching methods often require userspecified parameters, limiting their usefulness. This paper propos...
DIALM
2005
ACM
14 years 19 days ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
CAL
2002
13 years 10 months ago
2002
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
OL
2010
13 years 9 months ago
2010
We consider the convex optimization problem minx{f(x) : gj(x) ≤ 0, j = 1, . . . , m} where f is convex, the feasible set K is convex and Slater’s condition holds, but the funct...
ICIP
2010
IEEE
13 years 8 months ago
2010
IEEE
Current texture analysis methods enable good discrimination but are computationally too expensive for applications which require high frame rates. This occurs because they use red...