|
Theoretical analysis of local search in software testing
| Andrea Arcuri
| |
|
Learning volatility of discrete time series using prediction with expert advice
|
Vladimir V. V'yugin
| |
|
Graph embedding through random walk for shortest paths problems
|
Yakir Berchenko and Mina Teicher
| |
|
Firefly algorithms for multimodal optimization
|
Xin-She Yang
| |
|
Prediction of long-range dependent time series data with performance guarantee
|
Mikhail Dashevskiy and Zhiyuan Luo
| |
|
A generic algorithm for approximately solving stochastic graph optimization problems
|
Ei Ando, Hirotaka Ono, and Masafumi Yamashita
| |
|
Economical caching with stochastic prices
|
Matthias Englert, Berthold Voecking, and Melanie Winkler
| |
|
Stochastic dynamics of logistic tumor growth
|
Francesca Shearer, S. Sahoo, and A. Sahoo
| |
|
Relational properties expressible with one universal quantifier are testable
|
Charles Jordan and Thomas Zeugmann
| |
|
Markov modelling of BCL-2 controlled apoptosis
|
C. Grills, D.A. Fennell, and Francesca Shearer
| |
|
Propagation connectivity of random hyper graphs
|
Robert Berke and Mikael Onsjo
| |
|
Bipartite graph representation of multiple decision table classifiers
|
Kazuya Haraguchi, Seok-Hee Hong, and Hiroshi Nagamochi
| |
|
Bounds for multistage stochastic programs using supervised learning strategies
|
Boris Defourny, Damien Ernst, and Louis Wehenkel
| |
|
On evolvability: the swapping algorithm, product distributions, and covariance
|
Dimitrios Diochnos and György Turán
| |
|
How to design a linear cover time random walk on a finite graph
|
Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, and Masafumi Yamashita
| |
