265 search results - page 51 / 53 » Algorithms for Terminal Steiner Trees |
FSTTCS
1993
Springer
13 years 10 months ago
1993
Springer
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
INFOCOM
2002
IEEE
13 years 11 months ago
2002
IEEE
There has been a surge of interest in the delivery of personalized information to users (e.g. personalized stocks or travel information), particularly as mobile users with limited ...
ICPP
2008
IEEE
14 years 13 days ago
2008
IEEE
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
GECCO
2007
Springer
14 years 5 days ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters...