Sciweavers

605 search results - page 89 / 121
» Dealing with logical omniscience
Sort
View
RECONFIG
2009
IEEE
172views VLSI» more  RECONFIG 2009»
14 years 3 months ago
Combined SCA and DFA Countermeasures Integrable in a FPGA Design Flow
Abstract—The main challenge when implementing cryptographic algorithms in hardware is to protect them against attacks that target directly the device. Two strategies are customar...
Shivam Bhasin, Jean-Luc Danger, Florent Flament, T...
ICSOC
2004
Springer
14 years 2 months ago
Flexible coordination of service interaction patterns
Service-oriented computing is meant to support loose relationships between organisations: Collaboration procedures on the application-level translate to interaction processes via ...
Christian Zirpins, Winfried Lamersdorf, Toby Baier
IJCAI
1997
13 years 10 months ago
Exploiting Domain Knowledge for Approximate Diagnosis
The AI literature contains many definitions of diagnostic reasoning most of which are defined in terms of the logical entailment relation. We use existing work on approximate en...
Annette ten Teije, Frank van Harmelen
NDJFL
1998
105views more  NDJFL 1998»
13 years 8 months ago
Idempotent Full Paraconsistent Negations are not Algebraizable
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
Jean-Yves Béziau
GIS
2006
ACM
14 years 9 months ago
Representation of periodic moving objects in databases
In the real world, lots of objects with changing position can be found. Some of them repeat the same movement several times, called periodic movements. Examples include airplanes,...
Ralf Hartmut Güting, Thomas Behr, Victor Teix...