Sciweavers

644 search results - page 37 / 129
» Graph structured program evolution
Sort
View
CG
2004
Springer
14 years 11 months ago
Procedural 3D texture synthesis using genetic programming
The automatic synthesis of procedural textures for 3D surfaces using genetic programming is investigated. Genetic algorithms employ a search strategy inspired by Darwinian natural...
Adam Hewgill, Brian J. Ross
TLDI
2003
ACM
134views Formal Methods» more  TLDI 2003»
15 years 5 months ago
Scrap your boilerplate: a practical design pattern for generic programming
We describe a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types. Such programs often have a great deal of “boilerpl...
Ralf Lämmel, Simon L. Peyton Jones
NGC
1998
Springer
171views Communications» more  NGC 1998»
14 years 11 months ago
Programming Languages for Distributed Applications
Much progress has been made in distributed computing in the areas of distribution structure, open computing, fault tolerance, and security. Yet, writing distributed applications r...
Seif Haridi, Peter Van Roy, Per Brand, Christian S...
ICALP
2010
Springer
15 years 4 months ago
New Data Structures for Subgraph Connectivity
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
Ran Duan
TAGT
1994
Springer
154views Graph Theory» more  TAGT 1994»
15 years 4 months ago
Issues in the Practical Use of Graph Rewriting
Graphs are a popular data structure, and graph-manipulation programs are common. Graph manipulations can be cleanly, compactly, and explicitly described using graph-rewriting notat...
Dorothea Blostein, Hoda Fahmy, Ann Grbavec