Sciweavers

2006 search results - page 219 / 402
» Heuristic Security-Testing Methods
Sort
View
CP
2004
Springer
15 years 11 months ago
Quality of LP-Based Approximations for Highly Combinatorial Problems
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...
Lucian Leahu, Carla P. Gomes
DSMML
2004
Springer
15 years 11 months ago
Extensions of the Informative Vector Machine
The informative vector machine (IVM) is a practical method for Gaussian process regression and classification. The IVM produces a sparse approximation to a Gaussian process by com...
Neil D. Lawrence, John C. Platt, Michael I. Jordan
GECCO
2004
Springer
103views Optimization» more  GECCO 2004»
15 years 11 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...
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
15 years 11 months ago
Central Point Crossover for Neuro-genetic Hybrids
In this paper, we consider each neural network as a point in a multi-dimensional problem space and suggest a crossover that locates the central point of a number of neural networks...
Soonchul Jung, Byung Ro Moon
ICCS
2004
Springer
15 years 11 months ago
Routing and Wavelength Assignments in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
Hyunseung Choo, Vladimir V. Shakhov