Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

STOC
1996
ACM

favoriteEmaildiscussreport

118views Algorithms» more STOC 1996»

Towards an Analysis of Local Optimization Algorithms

13 years 8 months ago

Towards an Analysis of Local Optimization Algorithms

Download www.ait.gr

We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms of the properties of a tree-decomposition of the search graph. We show a large class of distributions for search graphs so that \Go with the winners" works well with high probability for almost all graphs from the distribution. We also give a su

Tassos Dimitriou, Russell Impagliazzo

Real-time Traffic

Algorithm | Algorithms | Search Graphs | STOC 1996 | Su±cient Combinatorial Property |

claim paper

Related Content

» Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT

» Explicit Local Models Towards Optimal Optimization Algorithms

» Know Thy Neighbor Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing

» Optimization of the sizing of a solar thermal electricity plant Mathematical programming v...

» On Some Properties of the lbest Topology in Particle Swarm Optimization

» Towards optimal bagoffeatures for object categorization and semantic video retrieval

» Role allocation and reallocation in multiagent teams towards a practical analysis

» Beyond local optimality An improved approach to hybrid model learning

» Towards a Complexity Model for Design and Analysis of PGASBased Algorithms

Post Info
More Details (n/a)

Added	08 Aug 2010
Updated	08 Aug 2010
Type	Conference
Year	1996
Where	STOC
Authors	Tassos Dimitriou, Russell Impagliazzo

Comments (0)