The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Stochastic boolean function evaluation (SBFE) is the problem of determining the value of a given boolean function f on an unknown input x, when each bit $$x_i$$ x i of x can only be determined by paying a given associated cost $$c_i$$ c i . Further, x is drawn from a given product distribution: for each $$x_i$$ x i , $$\mathbf{Pr}[x_i=1] = p_i$$ Pr [ x i =...
Given a Boolean function f, the quantity ess(f) denotes the largest set of assignments that falsify f, no two of which falsify a common implicate of f. Although ess(f) is clearly a lower bound on cnf_size(f) (the minimum number of clauses in a CNF formula for f), C˘epek et al. showed it is not, in general, a tight lower bound [6]. They gave examples of functions f for which there is a small gap between...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.