Sciweavers

1187 search results - page 143 / 238
» The Generalized Dimensionality Reduction Problem
Sort
View
ICCS
2009
Springer
15 years 4 months ago
Explicit Time Stepping Methods with High Stage Order and Monotonicity Properties
This paper introduces a three and a four order explicit time stepping method. These methods have high stage order and favorable monotonicity properties. The proposed methods are ba...
Emil M. Constantinescu, Adrian Sandu
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 1 months ago
Understanding particle swarms through simplification: a study of recombinant PSO
Simplified forms of the particle swarm algorithm are very beneficial in contributing to understanding of what makes a PSO swarm function in the way that it does. One of these form...
Daniel Bratton, Tim Blackwell
BMCBI
2006
154views more  BMCBI 2006»
14 years 10 months ago
Analysis with respect to instrumental variables for the exploration of microarray data structures
Background: Evaluating the importance of the different sources of variations is essential in microarray data experiments. Complex experimental designs generally include various fa...
Florent Baty, Michaël Facompré, Jan Wi...
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
15 years 10 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
15 years 4 months ago
COSMO: a correlation sensitive mutation operator for multi-objective optimization
This contribution is the first to discover exploitable structural features within circuit optimization problems (COP) and discuss how it is indicative of a general structure and ...
Varun Aggarwal, Una-May O'Reilly