Sciweavers

58 search results - page 12 / 12
» Relating Equivalence and Reducibility to Sparse Sets
Sort
View
CSCLP
2008
Springer
13 years 7 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
BMCBI
2010
105views more  BMCBI 2010»
13 years 5 months ago
Effects of scanning sensitivity and multiple scan algorithms on microarray data quality
Background: Maximizing the utility of DNA microarray data requires optimization of data acquisition through selection of an appropriate scanner setting. To increase the amount of ...
Andrew Williams, Errol M. Thomson
ANOR
2005
160views more  ANOR 2005»
13 years 5 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...