Sciweavers

16404 search results - page 653 / 3281
» A set coverage problem
Sort
View
ESANN
2007
15 years 8 months ago
Complexity bounds of radial basis functions and multi-objective learning
In the paper, the problem of multi-objective (MOBJ) learning is discussed. The problem of obtaining apparent (effective) complexity measure, which is one of the objectives, is con...
Illya Kokshenev, Antônio de Pádua Bra...
ISASSCI
2001
15 years 8 months ago
Distributing the Derivation and Maintenance of Subset Descriptor Rules
This draft paper describes a solution to the rule maintenance problem for data descriptor rules derived from data that may subsequently change. The method utilises any available c...
Jerome Robinson, Barry G. T. Lowden, Mohammed Al H...
CSDA
2008
65views more  CSDA 2008»
15 years 7 months ago
On the number of principal components: A test of dimensionality based on measurements of similarity between matrices
An important problem in principal component analysis (PCA) is the estimation of the correct number of components to retain. PCA is most often used to reduce a set of observed vari...
Stéphane Dray
JPDC
2008
115views more  JPDC 2008»
15 years 7 months ago
On Byzantine generals with alternative plans
This paper proposes a variation of the Byzantine generals problem (or Byzantine consensus). Each general has a set of good plans and a set of bad plans. The problem is to make all...
Miguel Correia, Alysson Neves Bessani, Paulo Ver&i...
JCO
2006
68views more  JCO 2006»
15 years 7 months ago
Strengthened 0-1 linear formulation for the daily satellite mission planning
In this paper, we compare several 0-1 linear programs for solving the satellite mission planning problem. We prove that one of them presents a smaller integrality gap. Our explana...
Virginie Gabrel