Sciweavers

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

12

FOCS
2000
IEEE

favoriteEmaildiscussreport

99views Theoretical Computer Science» more FOCS 2000»

Optimal myopic algorithms for random 3-SAT

13 years 9 months ago

Optimal myopic algorithms for random 3-SAT

Download www.math.cmu.edu

Dimitris Achlioptas, Gregory B. Sorkin

Real-time Traffic

FOCS 2000 | Theoretical Computer Science |

claim paper

Related Content

» Observed Lower Bounds for Random 3SAT Phase Transition Density Using Linear Programming

» Random 3SAT and BDDs The Plot Thickens Further

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

» Does overfitting affect performance in estimation of distribution algorithms

» FarSighted Active Learning on a Budget for Image and Video Recognition

» Sums of squares based approximation algorithms for MAXSAT

» On the Relative Merits of Simple Local Search Methods for the MAXSAT Problem

» Dynamic conjectures in random access networks using bioinspired learning

» Adaptive multimodality sensor scheduling for detection and tracking of smart targets

Post Info
More Details (n/a)

Added	31 Jul 2010
Updated	31 Jul 2010
Type	Conference
Year	2000
Where	FOCS
Authors	Dimitris Achlioptas, Gregory B. Sorkin

Comments (0)