494 search results - page 61 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
CSR
2009
Springer
14 years 2 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
TIT
2008
13 years 7 months ago
2008
An underdetermined linear system of equations Ax = b with non-negativity constraint x 0 is considered. It is shown that for matrices A with a row-span intersecting the positive o...
WABI
2007
Springer
14 years 1 months ago
2007
Springer
The aim of the motif recognition problem is to detect a set of mutually similar subsequences within a collection of biological sequences. The weak motif recognition problem on DNA ...
ML
2008
ACM
13 years 7 months ago
2008
ACM
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
PPSN
1992
Springer
13 years 11 months ago
1992
Springer
In this paper, we describe the application of a new type of genetic algorithm called the Structured Genetic Algorithm (sGA) for function optimization in nonstationary environments...