7167 search results - page 278 / 1434 » Answer Set Programming |
109
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distribut...
144
click to vote
BIBM
2010
IEEE
15 years 16 days ago
2010
IEEE
We propose a method for finding CRMs in a set of co-regulated genes. Each CRM consists of a set of binding sites of transcription factors. We wish to find CRMs involving the same t...
108
Voted
TIT
2011
14 years 9 months ago
2011
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...
140
click to vote
OL
2011
14 years 5 months ago
2011
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
249
Voted
POPL
2009
ACM
16 years 3 months ago
2009
ACM
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...