633 search results - page 37 / 127 » Locality and Hard SAT-Instances |
BMCBI
2011
13 years 4 months ago
2011
Background: Molecular database search tools need statistical models to assess the significance for the resulting hits. In the classical approach one asks the question how probable...
ECAI
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. In constraint networks, the efficiency of a search algorithm is strongly related to the local consistency maintained during search. For a long time, it has been consider...
ANLP
2000
13 years 11 months ago
2000
In natural language generation, different generation tasks often interact with each other in a complex way, which is hard to capture in the pipeline architecture described by Reit...
IJAR
2007
13 years 9 months ago
2007
Possibilistic networks are important tools for dealing with uncertain pieces of information. For multiplyconnected networks, it is well known that the inference process is a hard ...
PODS
2010
ACM
14 years 2 months ago
2010
ACM
Abiteboul et al. initiated the systematic study of distributed XML documents consisting of several logical parts, possibly located on different machines. The physical distributio...