Sciweavers

2244 search results - page 88 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
CIS
2008
Springer
15 years 8 months ago
A Near-Optimal Redundancy Allocation Strategy that Minimizes a System's Vulnerability to Hazardous Events and Malicious Attacks
Delivering continuous services in information infrastructures is a major challenge. For system or network administrators, redundancy allocation is one of the best strategies to en...
Frank Yeong-Sung Lin, Po-Hao Tsang, Kun-Dao Jiang
CHARME
2001
Springer
107views Hardware» more  CHARME 2001»
15 years 9 months ago
Using Combinatorial Optimization Methods for Quantification Scheduling
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
Pankaj Chauhan, Edmund M. Clarke, Somesh Jha, Jame...
CPAIOR
2005
Springer
15 years 11 months ago
Mixed Discrete and Continuous Algorithms for Scheduling Airborne Astronomy Observations
We describe the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne telescope. The problem requires maximizing the nu...
Jeremy Frank, Elif Kürklü
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
15 years 11 months ago
A new evolutionary method for time series forecasting
This paper presents a new method — the Time-delay Added Evolutionary Forecasting (TAEF) method — for time series prediction which performs an evolutionary search of the minimu...
Tiago A. E. Ferreira, Germano C. Vasconcelos, Paul...
PR
2008
131views more  PR 2008»
15 years 6 months ago
A memetic algorithm for evolutionary prototype selection: A scaling up approach
Prototype selection problem consists of reducing the size of databases by removing samples that are considered noisy or not influential on nearest neighbour classification tasks. ...
Salvador García, José Ramón C...