Sciweavers

2925 search results - page 128 / 585
» Information Complexity of Online Problems
Sort
View
ALENEX
2004
121views Algorithms» more  ALENEX 2004»
15 years 7 months ago
Experimental Comparison of Shortest Path Approaches for Timetable Information
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the time-expanded approach every event...
Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Ch...
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
15 years 4 months ago
Gaussian Processes for Sample Efficient Reinforcement Learning with RMAX-Like Exploration
Abstract. We present an implementation of model-based online reinforcement learning (RL) for continuous domains with deterministic transitions that is specifically designed to achi...
Tobias Jung, Peter Stone
BMCBI
2005
156views more  BMCBI 2005»
15 years 6 months ago
A new dynamical layout algorithm for complex biochemical reaction networks
Background: To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computatio...
Katja Wegner, Ursula Kummer
SAC
2005
ACM
16 years 6 min ago
A complex biological database querying method
Many biological information systems rely on relational database management systems (RDBMS) to manage high-throughput biological data. While keeping these data well archived, organ...
Jake Yue Chen, John V. Carlis, Ning Gao
TNN
2010
173views Management» more  TNN 2010»
15 years 1 months ago
Global synchronization for discrete-time stochastic complex networks with randomly occurred nonlinearities and mixed time delays
Abstract--In this paper, the problem of stochastic synchronization analysis is investigated for a new array of coupled discretetime stochastic complex networks with randomly occurr...
Zidong Wang, Yao Wang, Yurong Liu