Mean field annealing

Mean field annealing is a deterministic approximation to the simulated annealing technique of solving optimization problems. This method uses mean… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1988-2017
051019882017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We study the problem of interference alignment in the multiple-input multiple-output interference channel. Aiming at minimizing… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1998
1998
This paper presents our work on the static task scheduling model using the mean-field annealing (MFA) technique. Mean-field… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1998
1998
This paper is an extension of our previous paper to improve the capability of detecting corners. We proposed a method of boundary… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 6
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Packet radio (PR) is a technology that applies the packet switching technique to the broadcast radio environment. In a PR network… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
1995
1995
Mean eld annealing (MFA) algorithm, proposed for solving combinatorial optimization problems, combines the characteristics of… (More)
Is this relevant?
1995
1995
In this paper, we attack the figure — ground discrimination problem from a combinatorial optimization perspective. In general… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Optimization problems are approached using mean field annealing (MFA), which is a deterministic approximation, using mean field… (More)
  • figure 2
  • figure 3
  • figure 1
  • figure 4
  • figure 5
Is this relevant?
1992
1992
A new mapping heuristic is developed based on the recently proposed Mean Field Annealing MFA algorithm An e cient implementation… (More)
Is this relevant?
1988
1988
Nearly optimal solutions to many combinatorial problems can be found using stochastic simulated annealing. This paper extends the… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
Is this relevant?
1988
1988
The application which motivates this paper is image analysis; specifically the analysis of range images. We [BS86] [GS87] and… (More)
  • figure 1
  • figure 3
Is this relevant?