Sciweavers

83 search results - page 3 / 17
» Unroll-and-Jam Using Uniformly Generated Sets
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
DAM
2007
88views more  DAM 2007»
13 years 7 months ago
Hybrid one-dimensional reversible cellular automata are regular
It is shown that the set of hybrid one-dimensional reversible cellular automata (CA) with the periodic boundary condition is a regular set. This has several important consequences...
Jesse D. Bingham, Brad Bingham
ACL
1996
13 years 8 months ago
Chart Generation
Charts constitute a natural uniform architecture for parsing and generation provided string position is replaced by a notion more appropriate to logical forms and that measures ar...
Martin Kay
PPSN
2004
Springer
14 years 25 days ago
Phase Transition Properties of Clustered Travelling Salesman Problem Instances Generated with Evolutionary Computation
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
Jano I. van Hemert, Neil Urquhart
CSFW
2006
IEEE
14 years 1 months ago
On the Completeness of Attack Mutation Algorithms
An attack mutation algorithm takes a known instance of an attack and transforms it into many distinct instances by repeatedly applying attack transformations. Such algorithms are ...
Shai Rubin, Somesh Jha, Barton P. Miller