Sciweavers

644 search results - page 64 / 129
» Graph structured program evolution
Sort
View
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
15 years 6 months ago
Identifying graphs from noisy and incomplete data
There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biologic...
Galileo Mark S. Namata Jr., Lise Getoor
SODA
2004
ACM
82views Algorithms» more  SODA 2004»
15 years 1 months ago
Dynamizing static algorithms, with applications to dynamic trees and history independence
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorg...
COMSWARE
2008
IEEE
15 years 1 months ago
Extracting dense communities from telecom call graphs
Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typi...
Vinayaka Pandit, Natwar Modani, Sougata Mukherjea,...
AE
2005
Springer
15 years 5 months ago
Size Control with Maximum Homologous Crossover
Most of the Evolutionary Algorithms handling variable-sized structures, like Genetic Programming, tend to produce too long solutions and the recombination operator used is often co...
Michael Defoin-Platel, Manuel Clergue, Philippe Co...
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
15 years 5 months ago
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra...