Results 21 to 30 of about 461,035 (286)
Smoothed Complexity Theory [PDF]
, 2012 Smoothed analysis is a new way of analyzing algorithms introduced by Spielman and Teng (J. ACM, 2004). Classical methods like worst-case or average-case analysis have accompanying complexity classes, like P and AvgP, respectively.
A. Bogdanov +18 more
core +3 more sources
Smooth discrimination analysis
The Annals of Statistics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mammen, Enno, Tsybakov, Alexandre B.
openaire +5 more sources
Smoothed Analysis of Population Protocols
CoRR, 2021 In this work, we initiate the study of \emph{smoothed analysis} of population protocols. We consider a population protocol model where an adaptive adversary dictates the interactions between agents, but with probability $p$ every such interaction may change into an interaction between two agents chosen uniformly at random.
Schwartzman, Gregory, Sudo, Yuichi
openaire +4 more sources
Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method [PDF]
TheoretiCSThe simplex method for linear programming is known to be highly efficient in practice, and understanding its performance from a theoretical perspective is an active research topic. The framework of smoothed analysis, first introduced by Spielman and Teng
Sophie Huiberts +2 more
doaj +1 more source
Smoothed Analysis for the Conjugate Gradient Algorithm [PDF]
, 2016 The purpose of this paper is to establish bounds on the rate of convergence of the conjugate gradient algorithm when the underlying matrix is a random positive definite perturbation of a deterministic positive definite matrix.
Menon, Govind, Trogdon, Thomas
core +1 more source
Applied Sciences, 2021 Seismicity-based earthquake forecasting models have been primarily studied and developed over the past twenty years. These models mainly rely on seismicity catalogs as their data source and provide forecasts in time, space, and magnitude in a ...
Matteo Taroni, Aybige Akinci
doaj +1 more source
Modeling and Simulation Techniques Used in High Strain Rate Projectile Impact
Mathematics, 2021 A series of computational models and simulations were conducted for determining the dynamic responses of a solid metal projectile impacting a target under a prescribed high strain rate loading scenario in three-dimensional space.
Derek G. Spear +2 more
doaj +1 more source
Smoothed Efficient Algorithms and Reductions for Network Coordination Games [PDF]
, 2019 Worst-case hardness results for most equilibrium computation problems have raised the need for beyond-worst-case analysis. To this end, we study the smoothed complexity of finding pure Nash equilibria in Network Coordination Games, a PLS-complete problem
Boodaghians, Shant +2 more
core +2 more sources
The Smoothed Analysis of Algorithms
, 2005 Spielman and Teng introduced the smoothed analysis of algorithms to provide a framework in which one could explain the success in practice of algorithms and heuristics that could not be understood through the traditional worst-case and average-case analyses. In this talk, we survey some of the smoothed analyses that have been performed.
Spielman, Daniel A., Teng, Shang-Hua
openaire +3 more sources
Cancer incidence in men: a cluster analysis of spatial patterns
BMC Cancer, 2008 Background Spatial clustering of different diseases has received much less attention than single disease mapping. Besides chance or artifact, clustering of different cancers in a given area may depend on exposure to a shared risk factor or to multiple ...
D'Alò Daniela +4 more
doaj +1 more source