Sciweavers

8486 search results - page 36 / 1698
» Ordered Enumeration Method
Sort
View
VTS
2002
IEEE
101views Hardware» more  VTS 2002»
15 years 4 months ago
Speeding Up The Byzantine Fault Diagnosis Using Symbolic Simulation
Fault diagnosis is to predict the potential fault sites in a logic IC. In this paper, we particularly address the problem of diagnosing faults that exhibit the so-called Byzantine...
Shi-Yu Huang
KR
2010
Springer
15 years 3 months ago
On the Complexity of Axiom Pinpointing in the EL Family of Description Logics
We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence...
Rafael Peñaloza, Baris Sertkaya
IJCAI
1989
15 years 1 months ago
Reasoning About Hidden Mechanisms
1 describe an approach to the problem of forming hypotheses about hidden mechanisms w; thin devices — the "black box" problem for physical systems. The approach involv...
Richard J. Doyle
COLOGNETWENTE
2009
15 years 28 days ago
Improved Strategies for Branching on General Disjunctions
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
Gérard Cornuéjols, Leo Liberti, Giac...
JCT
2006
67views more  JCT 2006»
14 years 11 months ago
On the coexistence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs
We show that a near resolvable 2-(2k + 1, k, k - 1) design exists if and only if a conference matrix of order 2k + 2 does. A known result on conference matrices then allows us to ...
Malcolm Greig, Harri Haanpää, Petteri Ka...