Sciweavers

93 search results - page 3 / 19
» Monotonicity testing over general poset domains
Sort
View
APPROX
2007
Springer
153views Algorithms» more  APPROX 2007»
13 years 12 months ago
Distribution-Free Testing Lower Bounds for Basic Boolean Functions
: In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input dom...
Dana Glasner, Rocco A. Servedio
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
13 years 9 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
SIAMCOMP
2010
94views more  SIAMCOMP 2010»
13 years 4 months ago
Local Monotonicity Reconstruction
We propose a general model of local property reconstruction. Suppose we have a function f on domain Γ, which is supposed to have a particular property P, but may not have the pro...
Michael E. Saks, C. Seshadhri
RTSS
1998
IEEE
13 years 10 months ago
Statistical Rate Monotonic Scheduling
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [10] for periodic tasks with highly variable execution times and s...
Alia Atlas, Azer Bestavros
GECCO
2005
Springer
112views Optimization» more  GECCO 2005»
13 years 11 months ago
Monotonic solution concepts in coevolution
Assume a coevolutionary algorithm capable of storing and utilizing all phenotypes discovered during its operation, for as long as it operates on a problem; that is, assume an algo...
Sevan G. Ficici