3894 search results - page 516 / 779 » Approximation Algorithms for Biclustering Problems |
116
click to vote
DAGSTUHL
2008
15 years 5 months ago
2008
The Exact Geometric Computation (EGC) mode of computation has been developed over the last decade in response to the widespread problem of numerical non-robustness in geometric al...
142
click to vote
ESANN
2008
15 years 5 months ago
2008
Using multilayer perceptrons (MLPs) to approximate the state-action value function in reinforcement learning (RL) algorithms could become a nightmare due to the constant possibilit...
134
click to vote
ICMLA
2008
15 years 5 months ago
2008
High dimensionality of belief space in Partially Observable Markov Decision Processes (POMDPs) is one of the major causes that severely restricts the applicability of this model. ...
129
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input pe...
140
click to vote
JC
1998
15 years 3 months ago
1998
The problem of global solution of Fredholm integral equations is studied. This means that one seeks to approximate the full solution function (as opposed to the local problem, whe...