Sciweavers

Share
TEC
2012
195views Formal Methods» more  TEC 2012»
7 years 9 months ago
The Effects of Constant and Bit-Wise Neutrality on Problem Hardness, Fitness Distance Correlation and Phenotypic Mutation Rates
Kimura’s neutral theory of evolution has inspired researchers from the evolutionary computation community to incorporate neutrality into Evolutionary Algorithms (EAs) in the hop...
Riccardo Poli, Edgar Galván López
TEC
2012
234views Formal Methods» more  TEC 2012»
7 years 9 months ago
Cooperatively Coevolving Particle Swarms for Large Scale Optimization
—This paper presents a new cooperative coevolving particle swarm optimization (CCPSO) algorithm in an attempt to address the issue of scaling up particle swarm optimization (PSO)...
Xiaodong Li, Xin Yao
SAS
2012
Springer
210views Formal Methods» more  SAS 2012»
7 years 9 months ago
Bilateral Algorithms for Symbolic Abstraction
Aditya V. Thakur, Matt Elder, Thomas W. Reps
SAS
2012
Springer
208views Formal Methods» more  SAS 2012»
7 years 9 months ago
Finding Non-terminating Executions in Distributed Asynchronous Programs
Programming distributed and reactive asynchronous systems is complex due to the lack of synchronization between concurrently executing tasks, and arbitrary delay of message-based c...
Michael Emmi, Akash Lal
SAS
2012
Springer
226views Formal Methods» more  SAS 2012»
7 years 9 months ago
A Structural Soundness Proof for Shivers's Escape Technique - A Case for Galois Connections
Abstract. Shivers’s escape technique enables one to analyse the control flow of higher-order program fragments. It is widely used, but its soundness has never been proven. In th...
Jan Midtgaard, Michael D. Adams 0001, Matthew Migh...
SIAMDM
2011
8 years 9 months ago
Counting Independent Sets Using the Bethe Approximation
Venkat Chandrasekaran, Misha Chertkov, David Gamar...
SIAMCOMP
2011
8 years 9 months ago
A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives
The Gibbard-Satterthwaite theorem states that every non-dictatorial election rule among at least three alternatives can be strategically manipulated. We prove a quantitative versi...
Ehud Friedgut, Gil Kalai, Nathan Keller, Noam Nisa...
SIAMCOMP
2011
8 years 9 months ago
An Expansion Tester for Bounded Degree Graphs
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...
Satyen Kale, C. Seshadhri
SIAMCOMP
2011
8 years 9 months ago
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
SIAMCO
2011
8 years 9 months ago
Weak Dynamic Programming Principle for Viscosity Solutions
Abstract. We prove a weak version of the dynamic programming principle for standard stochastic control problems and mixed control-stopping problems, which avoids the technical di...
Bruno Bouchard, Nizar Touzi
books