Sciweavers

4 search results - page 1 / 1
» On-The-Fly Resolve Trace Minimization
Sort
View
DAC
2007
ACM
14 years 6 months ago
On-The-Fly Resolve Trace Minimization
The ability of modern SAT solvers to produce proofs of unsatisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve t...
Ohad Shacham, Karen Yorav
JODS
2008
123views Data Mining» more  JODS 2008»
13 years 5 months ago
A Fine-Grained Approach to Resolving Unsatisfiable Ontologies
The ability to deal with inconsistencies and to evaluate the impact of possible solutions for resolving inconsistencies are of the utmost importance in real world ontology applicat...
Joey Sik Chun Lam, Derek H. Sleeman, Jeff Z. Pan, ...
DMSN
2005
ACM
13 years 7 months ago
The threshold join algorithm for top-k queries in distributed sensor networks
In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for distributed sensor networks. The objective of a top-k query...
Demetrios Zeinalipour-Yazti, Zografoula Vagena, Di...
ICPP
2007
IEEE
13 years 11 months ago
Improving Search Using a Fault-Tolerant Overlay in Unstructured P2P Systems
Gnutella overlays have evolved to use a two-tier topology. However, we observed that the new topology had only achieved modest improvements in search success rates. Also, the new ...
William Acosta, Surendar Chandra