Sciweavers

240 search results - page 26 / 48
» Infinite trace equivalence
Sort
View
COMCOM
2002
124views more  COMCOM 2002»
14 years 11 months ago
Thin-client Web access patterns: Measurements from a cache-busting proxy
This paper describes a new technique for measuring Web client request patterns and analyzes a large client trace collected using the new method. In this approach a modified proxy ...
Terence Kelly
LOGCOM
2010
128views more  LOGCOM 2010»
14 years 6 months ago
Comparing LTL Semantics for Runtime Verification
When monitoring a system wrt. a property defined in a temporal logic such as LTL, a major concern is to settle with an adequate interpretation of observable system events; that is,...
Andreas Bauer 0002, Martin Leucker, Christian Scha...
ICPR
2006
IEEE
16 years 27 days ago
Image template matching using Mutual Information and NP-Windows
A non-parametric (NP) sampling method is introduced for obtaining the joint distribution of a pair of images. This method is called NP windowing and is equivalent to sampling the ...
N. D. H. Dowson, Richard Bowden, Timor Kadir
ICML
2009
IEEE
16 years 18 days ago
Model-free reinforcement learning as mixture learning
We cast model-free reinforcement learning as the problem of maximizing the likelihood of a probabilistic mixture model via sampling, addressing both the infinite and finite horizo...
Nikos Vlassis, Marc Toussaint
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
15 years 5 months ago
EA models and population fixed-points versus mutation rates for functions of unitation
Using a dynamic systems model for the Simple Genetic Algorithm due to Vose[1], we analyze the fixed point behavior of the model without crossover applied to functions of unitation...
J. Neal Richter, John Paxton, Alden H. Wright