Sciweavers

193 search results - page 30 / 39
» A Tractable Class of Abduction Problems
Sort
View
ICDCS
1992
IEEE
13 years 11 months ago
End-to-End Scheduling to Meet Deadlines in Distributed Systems
In a distributed system or communication network tasks may need to be executed on more than one processor. For time-critical tasks, the timing constraints are typically given as e...
Riccardo Bettati, Jane W.-S. Liu
VLSID
2007
IEEE
97views VLSI» more  VLSID 2007»
14 years 7 months ago
Efficient Microprocessor Verification using Antecedent Conditioned Slicing
We present a technique for automatic verification of pipelined microprocessors using model checking. Antecedent conditioned slicing is an efficient abstraction technique for hardw...
Shobha Vasudevan, Vinod Viswanath, Jacob A. Abraha...
STOC
2002
ACM
140views Algorithms» more  STOC 2002»
14 years 7 months ago
Finding nearest neighbors in growth-restricted metrics
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
David R. Karger, Matthias Ruhl
PODS
2008
ACM
129views Database» more  PODS 2008»
14 years 7 months ago
Tree-width and functional dependencies in databases
Conjunctive query (CQ) evaluation on relational databases is NP-complete in general. Several restrictions, like bounded tree-width and bounded hypertree-width, allow polynomial ti...
Isolde Adler
KSEM
2009
Springer
14 years 1 months ago
An Anytime Algorithm for Computing Inconsistency Measurement
Measuring the inconsistency degree of an inconsistent knowledge base is an important problem as it provides context information for facilitating inconsistency handling. Many method...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...