Sciweavers

1094 search results - page 52 / 219
» One Size Fits All
Sort
View
FOCS
2007
IEEE
14 years 4 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»
13 years 10 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
GECCO
2003
Springer
201views Optimization» more  GECCO 2003»
14 years 3 months ago
Solving Mastermind Using Genetic Algorithms
The MasterMind game involves decoding a secret code. The classic game is a code of six possible colors in four slots. The game has been analyzed and optimal strategies have been po...
Tom Kalisker, Doug Camens
COLT
1992
Springer
14 years 2 months ago
On the Computational Power of Neural Nets
This paper deals with finite size networks which consist of interconnections of synchronously evolving processors. Each processor updates its state by applying a "sigmoidal&q...
Hava T. Siegelmann, Eduardo D. Sontag
DATE
2005
IEEE
146views Hardware» more  DATE 2005»
14 years 3 months ago
Nonuniform Banking for Reducing Memory Energy Consumption
Main memories can consume a large percentage of overall energy in many data-intensive embedded applications. The past research proposed and evaluated memory banking as a possible ...
Ozcan Ozturk, Mahmut T. Kandemir