Sciweavers

503 search results - page 78 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
ISIPTA
2003
IEEE
15 years 3 months ago
Computing Lower Expectations with Kuznetsov's Independence Condition
Kuznetsov’s condition says that variables X and Y are independent when any product of bounded functions f(X) and g(Y) behaves in a certain way: the interval of expected values E...
Fabio Gagliardi Cozman
BSL
2000
153views more  BSL 2000»
14 years 9 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon
SP
2010
IEEE
210views Security Privacy» more  SP 2010»
15 years 1 months ago
Reconciling Belief and Vulnerability in Information Flow
Abstract—Belief and vulnerability have been proposed recently to quantify information flow in security systems. Both concepts stand as alternatives to the traditional approaches...
Sardaouna Hamadou, Vladimiro Sassone, Catuscia Pal...
SOCO
2010
Springer
14 years 4 months ago
Taximeter verification with GPS and soft computing techniques
Until recently, local governments in Spain were using machines with rolling cylinders for verifying taximeters. However, the condition of the tires can lead to errors in the proces...
José Villar, Adolfo Otero, José Oter...
CORR
2010
Springer
117views Education» more  CORR 2010»
14 years 9 months ago
Evolution with Drifting Targets
We consider the question of the stability of evolutionary algorithms to gradual changes, or drift, in the target concept. We define an algorithm to be resistant to drift if, for s...
Varun Kanade, Leslie G. Valiant, Jennifer Wortman ...