Sciweavers

329 search results - page 12 / 66
» Uniform variable splitting
Sort
View
GFKL
2005
Springer
105views Data Mining» more  GFKL 2005»
15 years 5 months ago
Variable Selection for Discrimination of More Than Two Classes Where Data are Sparse
In classification, with an increasing number of variables, the required number of observations grows drastically. In this paper we present an approach to put into effect the maxi...
Gero Szepannek, Claus Weihs
FOCS
2007
IEEE
15 years 6 months ago
Parameterized Proof Complexity
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
ECCC
2007
90views more  ECCC 2007»
14 years 11 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
CEC
2009
IEEE
15 years 4 months ago
A cooperative coevolutionary algorithm with Correlation based Adaptive Variable Partitioning
—A cooperative coevolutionary algorithm (CCEA) is an extension to an evolutionary algorithm (EA); it employs a divide and conquer strategy to solve an optimization problem. In it...
Tapabrata Ray, Xin Yao
FM
2009
Springer
124views Formal Methods» more  FM 2009»
15 years 6 months ago
Reasoning about Memory Layouts
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
Holger Gast