2681 search results - page 111 / 537 » Problem F |
WADS
2005
Springer
14 years 3 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
CSDA
2007
13 years 10 months ago
2007
Given a sample of n observations y1, . . . , yn at time points t1, . . . , tn we consider the problem of specifying a function ˜f such that ˜f • is smooth, • fits the data ...
EUROGP
2001
Springer
14 years 2 months ago
2001
Springer
This work is a study of neutrality in the context of Evolutionary Computation systems. In particular, we introduce the use of explicit neutrality with an integer string coding sche...
GEM
2008
13 years 11 months ago
2008
- It is widely believed that greater initial population diversity leads to improved performance in genetic algorithms. However, this assumption has not been rigorously tested previ...
ISCC
2005
IEEE
14 years 3 months ago
2005
IEEE
— We study the problem of computing minimal cost multicast trees in multi-hop wireless mesh networks. This problem is known as the Steiner tree problem, and it has been widely st...