Author of the publication

A Vascular Network Growth Estimation Algorithm Using Random Graphs.

, , , and . GbRPR, volume 3434 of Lecture Notes in Computer Science, page 45-53. Springer, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Feasible Encodings for GA Solutions of constrained Minimal Spanning Tree Problems., and . GECCO, page 754. Morgan Kaufmann, (2000)Efficient Calculation of Compute-Intensive Fitness In Genetic Computations Using A Survival Indicator For Population Members., and . GECCO, page 784. Morgan Kaufmann, (1999)Data mining - a powerful information creating tool., and . OCLC Syst. Serv., 15 (2): 81-90 (1999)Applying Artificial Intelligence Techniques to Problems of Incomplete Information: Optimizing Bidding in the Game of Bridge., , , and . IC-AI, page 385-392. CSREA Press, (2005)An application of seriation to agent development consensus: A genetic algorithm approach., , and . Bioconsensus, volume 61 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 113-121. DIMACS/AMS, (2001)A Genetic Algorithm With Feasible Search Space For Minimal Spanning Trees With Time-Dependent Edge Costs, , and . Genetic Programming 1998: Proceedings of the Third Annual Conference, page 495. University of Wisconsin, Madison, Wisconsin, USA, Morgan Kaufmann, (22-25 July 1998)A Vascular Network Growth Estimation Algorithm Using Random Graphs., , , and . GbRPR, volume 3434 of Lecture Notes in Computer Science, page 45-53. Springer, (2005)A Minimal Bidding Application (with Slack Time) Solved by a Genetic Algorithm where Element Costs Are Time Dependent., , and . GECCO Late Breaking Papers, page 76-82. AAAI, (2002)