922 search results - page 49 / 185 » Engineering a complex ontology with time |
FSTTCS
1992
Springer
15 years 2 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
DATE
2007
IEEE
15 years 4 months ago
2007
IEEE
We propose a robust circuit-based Boolean Satisfiability (SAT) solver, QuteSAT, that can be applied to complex circuit netlist structure. Several novel techniques are proposed in ...
101
click to vote
ICNC
2005
Springer
15 years 3 months ago
2005
Springer
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
AMT
2006
Springer
15 years 1 months ago
2006
Springer
In high-tech industries, most manufacturing processes are complexly intertwined, in that manufacturers or engineers can hardly control a whole set of processes. They are only capa...
EDCC
2008
Springer
14 years 11 months ago
2008
Springer
This work addresses the problem of software fault diagnosis in complex safety critical software systems. The transient manifestations of software faults represent a challenging is...