Sciweavers

1887 search results - page 345 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
ECAI
2004
Springer
13 years 11 months ago
Encoding Quantified CSPs as Quantified Boolean Formulae
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
ENTCS
2008
120views more  ENTCS 2008»
13 years 7 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke
ESWA
2006
148views more  ESWA 2006»
13 years 7 months ago
Applications of artificial intelligence in bioinformatics: A review
Artificial intelligence (AI) has increasingly gained attention in bioinformatics research and computational molecular biology. With the availability of different types of AI algor...
Zoheir Ezziane
PROCEDIA
2010
140views more  PROCEDIA 2010»
13 years 6 months ago
Jaccard Index based availability prediction in enterprise grids
Enterprise Grid enables sharing and aggregation of a set of computing or storage resources connected by enterprise network, but the availability of the resources in this environme...
Mustafizur Rahman 0003, Md. Rafiul Hassan, Rajkuma...
PVLDB
2010
123views more  PVLDB 2010»
13 years 6 months ago
Sharing-Aware Horizontal Partitioning for Exploiting Correlations During Query Processing
Optimization of join queries based on average selectivities is suboptimal in highly correlated databases. In such databases, relations are naturally divided into partitions, each ...
Kostas Tzoumas, Amol Deshpande, Christian S. Jense...