Sciweavers

267 search results - page 5 / 54
» Generating all maximal models of a Boolean expression
Sort
View
COLT
2003
Springer
14 years 26 days ago
Maximum Margin Algorithms with Boolean Kernels
Recent work has introduced Boolean kernels with which one can learn linear threshold functions over a feature space containing all conjunctions of length up to k (for any 1 ≤ k ...
Roni Khardon, Rocco A. Servedio
TACAS
2007
Springer
99views Algorithms» more  TACAS 2007»
14 years 1 months ago
"Don't Care" Modeling: A Logical Framework for Developing Predictive System Models
Analysis of biological data often requires an understanding of components of pathways and/or networks and their mutual dependency relationships. Such systems are often analyzed and...
Hillel Kugler, Amir Pnueli, Michael J. Stern, E. J...
IJCAI
2001
13 years 9 months ago
IBAL: A Probabilistic Rational Programming Language
In a rational programming language, a program specifies a situation faced by an agent; evaluating the program amounts to computing what a rational agent would believe or do in the...
Avi Pfeffer
BMCBI
2007
164views more  BMCBI 2007»
13 years 7 months ago
Comparison of probabilistic Boolean network and dynamic Bayesian network approaches for inferring gene regulatory networks
Background: The regulation of gene expression is achieved through gene regulatory networks (GRNs) in which collections of genes interact with one another and other substances in a...
Peng Li, Chaoyang Zhang, Edward J. Perkins, Ping G...
SCAM
2007
IEEE
14 years 1 months ago
On Temporal Path Conditions in Dependence Graphs
Program dependence graphs are a well-established device to represent possible information flow in a program. Path conditions in dependence graphs have been proposed to express mo...
Andreas Lochbihler, Gregor Snelting