Sciweavers

427 search results - page 20 / 86
» Sequential predictions based on algorithmic complexity
Sort
View
ICST
2009
IEEE
15 years 9 months ago
PKorat: Parallel Generation of Structurally Complex Test Inputs
Constraint solving lies at the heart of several specification-based approaches to automated testing. Korat is a previously developed algorithm for solving constraints in Java pro...
Junaid Haroon Siddiqui, Sarfraz Khurshid
ICDAR
2003
IEEE
15 years 7 months ago
A Low-Cost Parallel K-Means VQ Algorithm Using Cluster Computing
In this paper we propose a parallel approach for the Kmeans Vector Quantization (VQ) algorithm used in a twostage Hidden Markov Model (HMM)-based system for recognizing handwritte...
Alceu de Souza Britto Jr., Paulo Sergio Lopes de S...
130
Voted
ATAL
2007
Springer
15 years 8 months ago
Batch reinforcement learning in a complex domain
Temporal difference reinforcement learning algorithms are perfectly suited to autonomous agents because they learn directly from an agent’s experience based on sequential actio...
Shivaram Kalyanakrishnan, Peter Stone
WWW
2009
ACM
16 years 3 months ago
Seller's credibility in electronic markets: a complex network based approach
In the last decade, there has been an explosion of online commercial activity enabled by the World Wide Web. An electronic marketplace (e-market) provides an online method to perf...
Adriano M. Pereira, Arlei Silva, Wagner Meira Jr.,...
96
Voted
BMCBI
2010
105views more  BMCBI 2010»
15 years 2 months ago
A knowledge-guided strategy for improving the accuracy of scoring functions in binding affinity prediction
Background: Current scoring functions are not very successful in protein-ligand binding affinity prediction albeit their popularity in structure-based drug designs. Here, we propo...
Tiejun Cheng, Zhihai Liu, Renxiao Wang