Sciweavers

1957 search results - page 97 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
15 years 10 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
ICDT
2005
ACM
131views Database» more  ICDT 2005»
15 years 3 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
JMLR
2010
148views more  JMLR 2010»
14 years 4 months ago
A Generalized Path Integral Control Approach to Reinforcement Learning
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
Evangelos Theodorou, Jonas Buchli, Stefan Schaal
ICASSP
2011
IEEE
14 years 1 months ago
Image prediction based on non-negative matrix factorization
This paper presents a novel spatial texture prediction method based on non-negative matrix factorization. As an extension of template matching, approximation based iterative textu...
Mehmet Türkan, Christine Guillemot
CPM
2006
Springer
95views Combinatorics» more  CPM 2006»
15 years 1 months ago
New Bounds for Motif Finding in Strong Instances
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
Brona Brejová, Daniel G. Brown, Ian M. Harr...