Sciweavers

3318 search results - page 312 / 664
» The Weak Instance Model
Sort
View
AAAI
2000
15 years 6 months ago
Redundancy in Random SAT Formulas
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
Yacine Boufkhad, Olivier Roussel
HPCC
2010
Springer
15 years 6 months ago
Managing Peak Loads by Leasing Cloud Infrastructure Services from a Spot Market
Dedicated computing clusters are typically sized based on an expected average workload over a period of years, rather than on peak workloads, which might exist for relatively shor...
Michael Mattess, Christian Vecchiola, Rajkumar Buy...
IJAIT
2008
107views more  IJAIT 2008»
15 years 5 months ago
Haplotype Inference with Boolean Satisfiability
One of the main topics of research in genomics is determining the relevance of mutations, described in haplotype data, as causes of some genetic diseases. However, due to technolo...
Inês Lynce, João Marques-Silva
DAS
2010
Springer
15 years 3 months ago
Information extraction by finding repeated structure
Repetition of layout structure is prevalent in document images. In document design, such repetition conveys the underlying logical and functional structure of the data. For exampl...
Evgeniy Bart, Prateek Sarkar
DLOG
2009
15 years 2 months ago
Reasoning About Typicality in ALC and EL
In this work we summarize our recent results on extending Description Logics for reasoning about prototypical properties and inheritance with exceptions. First, we focus our attent...
Laura Giordano, Valentina Gliozzi, Nicola Olivetti...