The time complexity of maximum matching by simulated annealing

The time complexity of maximum matching by simulated annealing

Bibliography: p. 34.

Bibliographic Details
Other Authors:	Sasaki, Galen H.
Language:	eng
Published:	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology] 2003
Subjects:	TK7855.M41 E3845 no.1552
Online Access:	http://hdl.handle.net/1721.1/2930

Similar Items

A survey of large time asymptotics of simulated annealing algorithms
Published: (2003)

Convergence of the simulated annealing algorithm
Published: (2003)

Simulated annealing with noisy or imprecise energy measurements
Published: (2003)

Simulated annealing type algorithms for multivariate optimization
Published: (2003)

Simulated annealing type algorithms for multivariate optimization
Published: (2003)

Simulated annealing with noisy or imprecise energy measurements
Published: (2003)

On sampling methods and annealing algorithms
Published: (2002)

Analysis of simulated annealing for optimization
Published: (2003)

Optimal recursive maximum likelihood estimation
Published: (2003)

Metropolis-type annealing algorithms for global optimization in IRdÌ³
Published: (2003)

Weak convergence of Markov chain sampling methods and annealing algorithms to diffusions
Published: (2003)

Maximum a-Posteriori estimation of random fields.
Published: (2003)

Identification and filtering--optimal recursive maximum likelihood approach
Published: (2003)

Design of optical matched filters
Published: (2002)

Design of optical matched filters
Published: (2002)

Minimization of the maximum peak-to-peak gain--the general multiblock problem
Published: (2003)

Markov chains with rare transitions and simulated annealing
Published: (2003)

An efficient maximum entropy technique for 2-D isotropic random fields
Published: (2003)

An efficient maximum entropy technique for 2-D isotropic random fields
Published: (2003)

Frequency stabilization using matched Fabry-Perots as references
Published: (2002)

Maximum a-posteriori estimation of random fields : Part I, elliptic Gaussian fields observed via a noisy nonlinear channel
Published: (2003)

The complexity of Markov decision processes
Published: (2003)

Communication complexity of convex optimization
Published: (2003)

On the communication complexity of distributed algebraic computation
Published: (2003)

The information-based complexity of dynamic programming
Published: (2003)

The complexity of optimal queueing network control
Published: (2003)

On the communication complexity of solving a polynominal equation
Published: (2003)

Communication complexity of distributed shortest path algorithms
Published: (2003)

Complexity of stability and controllability of elementary hybrid systems
Published: (2003)

On the average communication complexity of asynchronous distributed algorithms
Published: (2003)

Complexity theoretic aspects of problems in control theory
Published: (2003)

On the average communication complexity of asynchronous distributed algorithms
Published: (2002)

An event driven job shop simulator
Published: (2003)

Execution strategies for Petri Net simulations
Published: (2003)

Some complexity results about packet radio networks
Published: (2003)

The design of simulation languages for systems with multiple modularities
Published: (2003)

Simulation-based optimization of Markov reward processes
Published: (2003)

Average waiting time assignment.
Published: (2003)

Average waiting time assignment.
Published: (2003)

Time-varying vs. time-invariant compensation for rejection of persistent bounded disturbances and robust stabilization
Published: (2003)