Sciweavers

7129 search results - page 559 / 1426
» Approximation Algorithms for Treewidth
Sort
View
GECCO
2000
Springer
138views Optimization» more  GECCO 2000»
15 years 11 months ago
Time Complexity of genetic algorithms on exponentially scaled problems
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
Fernando G. Lobo, David E. Goldberg, Martin Pelika...
AUSAI
2009
Springer
15 years 10 months ago
Classification-Assisted Memetic Algorithms for Equality-Constrained Optimization Problems
Regressions has successfully been incorporated into memetic algorithm (MA) to build surrogate models for the objective or constraint landscape of optimization problems. This helps ...
Stephanus Daniel Handoko, Chee Keong Kwoh, Yew-Soo...
NIPS
1998
15 years 8 months ago
SMEM Algorithm for Mixture Models
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Ryohei Nakano, Zoubin Ghahramani, Ge...
COLING
1992
15 years 8 months ago
Syntactic Ambiguity Resolution Using A Discrimination and Robustness Oriented Adaptive Learning Algorithm
In this paper, a discrimination and robusmess oriented adaptive learning procedure is proposed to deal with the task of syntactic ambiguity resolution. Owing to the problem of ins...
Tung-Hui Chiang, Yi-Chung Lin, Keh-Yih Su
CCS
2010
ACM
15 years 7 months ago
The security of modern password expiration: an algorithmic framework and empirical analysis
This paper presents the first large-scale study of the success of password expiration in meeting its intended purpose, namely revoking access to an account by an attacker who has ...
Yinqian Zhang, Fabian Monrose, Michael K. Reiter