The discrete optimization problem associated with partitioning a set of actors into core and periphery subsets has typically been approached using approximate procedures such as exchange heuristics, genetic algorithms, and simulated annealing. Although these procedures are effective and scalable for
โฆ LIBER โฆ
An exact probability distribution for a card matching problem
โ Scribed by Robert E Greenwood
- Publisher
- Elsevier Science
- Year
- 1966
- Tongue
- English
- Weight
- 183 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
An exact algorithm for a core/periphery
โ
Michael Brusco
๐
Article
๐
2011
๐
Elsevier Science
๐
English
โ 427 KB
An exact branch-and-bound procedure for
โ
M. S. Bazaraa; A. N. Elshafei
๐
Article
๐
1979
๐
John Wiley and Sons
๐
English
โ 927 KB
An exact algorithm for the Traveling Sal
โ
R. Baldacci; E. Hadjiconstantinou; A. Mingozzi
๐
Article
๐
2003
๐
John Wiley and Sons
๐
English
โ 182 KB
๐ 1 views
An exact solution of a time-dependent fr
โ
Oleg Yu. Zharii
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 545 KB
An exact test for the mean of a normal d
โ
Ramesh Gupta; Ram Tripathi; Joel Michalek; Thomas White
๐
Article
๐
1985
๐
Elsevier Science
๐
English
โ 355 KB
An Improved Approach for Estimating the
โ
HON-SHIANG LAU; AMY HING-LING LAU; YUE ZHANG
๐
Article
๐
1997
๐
John Wiley and Sons
๐
English
โ 236 KB
๐ 2 views
The literature oers many formulas for estimating the mean and standard deviation of a subjective probability distribution (a well-known example is the PERT formulas). This paper shows that some basic underlying assumptions behind most of these formulas are inappropriate; a more appropriate framework