Sciweavers

420 search results - page 51 / 84
» Generating random regular graphs
Sort
View
CCS
2006
ACM
13 years 11 months ago
EXE: automatically generating inputs of death
This paper presents EXE, an effective bug-finding tool that automatically generates inputs that crash real code. Instead of running code on manually or randomly constructed input,...
Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski, ...
GECCO
2000
Springer
114views Optimization» more  GECCO 2000»
13 years 11 months ago
Intelligent Recombination Using Individual Learning in a Collective Learning Genetic Algorithm
This paper introduces a new collective learning genetic algorithm (CLGA) which employs individual learning to do intelligent recombination based on a cooperative exchange of knowl...
Terry P. Riopka, Peter Bock
WEBI
2005
Springer
14 years 1 months ago
WICER: A Weighted Inter-Cluster Edge Ranking for Clustered Graphs
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
Divya Padmanabhan, Prasanna Kumar Desikan, Jaideep...
FUIN
2008
98views more  FUIN 2008»
13 years 7 months ago
A Restarted Strategy for Efficient Subsumption Testing
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
Ondrej Kuzelka, Filip Zelezný
MFCS
2004
Springer
14 years 1 months ago
Schema Evolution for XML: A Consistency-Preserving Approach
Abstract. This paper deals with updates of XML documents that satisfy a given schema, e.g., a DTD. In this context, when a given update violates the schema, it might be the case th...
Béatrice Bouchou, Denio Duarte, Mirian Half...