2976 search results - page 214 / 596 » On the bounded integer programming |
180
click to vote
WCNC
2008
IEEE
16 years 26 days ago
2008
IEEE
Abstract—In ad hoc position-location networks, location information is obtained through the sequential estimation of node locations. An unlocalized node can estimate its location...
148
click to vote
CPM
2006
Springer
15 years 10 months ago
2006
Springer
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
157
click to vote
UAI
2004
15 years 7 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
192
click to vote
CSFW
2011
IEEE
14 years 6 months ago
2011
IEEE
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
154
click to vote
ICLP
2003
Springer
15 years 11 months ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...