Sciweavers

1176 search results - page 151 / 236
» Implicit Abstraction Heuristics
Sort
View
GECCO
2004
Springer
103views Optimization» more  GECCO 2004»
15 years 6 months ago
Training Neural Networks with GA Hybrid Algorithms
Abstract. Training neural networks is a complex task of great importance in the supervised learning field of research. In this work we tackle this problem with five algorithms, a...
Enrique Alba, J. Francisco Chicano
114
Voted
GECCO
2004
Springer
103views Optimization» more  GECCO 2004»
15 years 6 months ago
Using a Genetic Algorithm to Design and Improve Storage Area Network Architectures
Abstract. Designing storage area networks is an NP-hard problem. Previous work has focused on traditional algorithmic techniques to automatically determine fabric requirements, net...
Elizabeth Dicke, Andrew Byde, Paul J. Layzell, Dav...
ICCS
2004
Springer
15 years 6 months ago
The Computational Complexity of Orientation Search in Cryo-Electron Microscopy
Abstract. In this paper we study the problem of determining threedimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central ...
Taneli Mielikäinen, Janne Ravantti, Esko Ukko...
95
Voted
ISCIS
2004
Springer
15 years 6 months ago
A Tabu Search Algorithm for Sparse Placement of Wavelength Converters in Optical Networks
Abstract. In this paper, we study the problem of placing limited number of wavelength converting nodes in a multi-fiber network with static traffic demands and propose a tabu sear...
Namik Sengezer, Ezhan Karasan
SAT
2004
Springer
117views Hardware» more  SAT 2004»
15 years 6 months ago
A Random Constraint Satisfaction Problem That Seems Hard for DPLL
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
Harold S. Connamacher