7167 search results - page 228 / 1434 » Answer Set Programming |
109
click to vote
TCS
2008
15 years 2 months ago
2008
Suppose we are given a set W of logical structures, or possible worlds, a set of logical formulas called possible data and a logical formula . We then consider the classification p...
114
click to vote
ANOR
2005
15 years 2 months ago
2005
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, the mixed 0-1 knapsack set, the integer ...
113
click to vote
SSDBM
2003
IEEE
15 years 7 months ago
2003
IEEE
Life science researchers frequently need to query large protein data sets in a variety of different ways. Protein data sets have a rich structure that includes its primary structu...
119
click to vote
BMCBI
2007
15 years 2 months ago
2007
Background: Three dimensional biomedical image sets are becoming ubiquitous, along with the canonical atlases providing the necessary spatial context for analysis. To make full us...
128
Voted
BMCBI
2008
15 years 2 months ago
2008
Background: The identification of transcription factor binding sites is difficult since they are only a small number of nucleotides in size, resulting in large numbers of false po...