Sciweavers

5 search results - page 1 / 1
» A genetic algorithm for the minimum broadcast time problem u...
Sort
View
SAC
1996
ACM
13 years 9 months ago
A genetic algorithm for the minimum broadcast time problem using a global precedence vector
The problem of broadcasting a message through a network is considered. The objective is to minimize the number of time steps necessary to complete the broadcast. This problem is k...
Cory J. Hoelting, Dale A. Schoenefeld, Roger L. Wa...
3DIM
2005
IEEE
13 years 11 months ago
Fitting of 3D Circles and Ellipses Using a Parameter Decomposition Approach
Many optimization processes encounter a problem in efficiently reaching a global minimum or a near global minimum. Traditional methods such as Levenberg-Marquardt algorithm and t...
Xiaoyi Jiang, Da-Chuan Cheng
CPHYSICS
2006
127views more  CPHYSICS 2006»
13 years 5 months ago
GenAnneal: Genetically modified Simulated Annealing
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report resu...
Ioannis G. Tsoulos, Isaac E. Lagaris
CP
2000
Springer
13 years 10 months ago
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
Benjamin W. Wah, Yixin Chen
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
14 years 6 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...