Sciweavers

15494 search results - page 2733 / 3099
» Computing dynamic clusters
Sort
View
BMCBI
2008
130views more  BMCBI 2008»
15 years 6 months ago
Function approximation approach to the inference of reduced NGnet models of genetic networks
Background: The inference of a genetic network is a problem in which mutual interactions among genes are deduced using time-series of gene expression patterns. While a number of m...
Shuhei Kimura, Katsuki Sonoda, Soichiro Yamane, Hi...
IJFCS
2006
130views more  IJFCS 2006»
15 years 6 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
JAIR
2008
126views more  JAIR 2008»
15 years 6 months ago
Optimal and Approximate Q-value Functions for Decentralized POMDPs
Decision-theoretic planning is a popular approach to sequential decision making problems, because it treats uncertainty in sensing and acting in a principled way. In single-agent ...
Frans A. Oliehoek, Matthijs T. J. Spaan, Nikos A. ...
SIAMSC
2008
131views more  SIAMSC 2008»
15 years 6 months ago
Gramian-Based Model Reduction for Data-Sparse Systems
Model order reduction (MOR) is common in simulation, control and optimization of complex dynamical systems arising in modeling of physical processes and in the spatial discretizati...
Ulrike Baur, Peter Benner
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
15 years 6 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
« Prev « First page 2733 / 3099 Last » Next »