4679 search results - page 110 / 936 » Modeling When Connections Are the Problem |
107
click to vote
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. The building block hypothesis implies that the epistatic property of a given problem must be connected well to the linkage property of the employed representation and cro...
116
click to vote
FOCS
2005
IEEE
15 years 7 months ago
2005
IEEE
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
106
click to vote
AAAI
1998
15 years 3 months ago
1998
Despite much research that has been done on constraint satisfaction problems (CSP's), the framework is sometimes inflexible and the results are not very satisfactory when app...
115
click to vote
WG
2004
Springer
15 years 7 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...