Sciweavers

4695 search results - page 636 / 939
» Software Clustering Techniques and the Use of Combined Algor...
Sort
View
FSTTCS
2006
Springer
15 years 10 months ago
Testing Probabilistic Equivalence Through Reinforcement Learning
We propose a new approach to verification of probabilistic processes for which the model may not be available. We use a technique from Reinforcement Learning to approximate how far...
Josee Desharnais, François Laviolette, Sami...
AVI
2004
15 years 8 months ago
Quantum web fields and molecular meanderings: visualising web visitations
This paper describes two visualisation algorithms that give an impression of current activity on a web site. Both focus on giving a sense of the trail of individual visitors withi...
Geoffrey Ellis, Alan J. Dix
CC
2008
Springer
131views System Software» more  CC 2008»
15 years 6 months ago
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
Marius Zimand
BMCBI
2004
95views more  BMCBI 2004»
15 years 6 months ago
PCOGR: Phylogenetic COG ranking as an online tool to judge the specificity of COGs with respect to freely definable groups of or
Background: The rapidly increasing number of completely sequenced genomes led to the establishment of the COG-database which, based on sequence homologies, assigns similar protein...
Florian Meereis, Michael Kaufmann
SIGSOFT
2003
ACM
16 years 7 months ago
Towards scalable compositional analysis by refactoring design models
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
Yung-Pin Cheng, Michal Young, Che-Ling Huang, Chia...