Sciweavers

2266 search results - page 222 / 454
» Some Solutions to the Ignoring Problem
Sort
View
AAAI
1990
15 years 7 months ago
Operationality Criteria for Recursive Predicates
Current explanation-based generalization (EBG) techniques can perform badly when the problem being solved involves recursion. Often an infinite series of learned concepts are gene...
Stanley Letovsky
AE
2009
Springer
15 years 7 months ago
Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
15 years 7 months ago
Aiming for a theoretically tractable CSA variant by means of empirical investigations
Evolution Strategies (ES) for black-box optimization of a function f : Rn → R are investigated. Namely, we consider the cumulative step-size adaptation (CSA) for the variance of...
Jens Jägersküpper, Mike Preuss
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
15 years 6 months ago
A Robust PTAS for Machine Covering and Packing
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
Martin Skutella, José Verschae
DEDS
2010
88views more  DEDS 2010»
15 years 6 months ago
Optimal Admission Control of Discrete Event Systems with Real-Time Constraints
Abstract-- The problem of optimally controlling the processing rate of tasks in Discrete Event Systems (DES) with hard real-time constraints has been solved in [9] under the assump...
Jianfeng Mao, Christos G. Cassandras