706 search results - page 58 / 142 » On a quasi-ordering on Boolean functions |
SAS
2004
Springer
14 years 2 months ago
2004
Springer
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
TSP
2008
13 years 8 months ago
2008
Abstract--The dynamics of a rule-based gene regulatory network are determined by the regulatory functions in conjunction with whatever probability distributions are involved in net...
GECCO
2008
Springer
13 years 10 months ago
2008
Springer
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
CC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
LPNMR
2009
Springer
14 years 3 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...