Sciweavers

1061 search results - page 159 / 213
» Dependently Sorted Logic
Sort
View
ACSD
2008
IEEE
106views Hardware» more  ACSD 2008»
15 years 1 months ago
Time-bounded model checking of infinite-state continuous-time Markov chains
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
Lijun Zhang, Holger Hermanns, Ernst Moritz Hahn, B...
ICALP
2010
Springer
15 years 1 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
CCIA
2009
Springer
15 years 29 days ago
Anytime Reasoning Mechanism for Conversational Agents
When an agent receives a query from another agent, it tries to satisfy it by building an answer based on its current knowledge. Depending on the available time or the urgency of t...
M. Mariela Morveli-Espinoza, Josep Puyol-Gruart
IJMSO
2006
105views more  IJMSO 2006»
14 years 12 months ago
A framework for context-sensitive metadata description
Recent expectations regarding the new generation of Web strongly depend on the success of Semantic Web technology. Resource Description Framework (RDF) is a basis for an explicit a...
Oleksiy Khriyenko, Vagan Y. Terziyan
CASES
2010
ACM
14 years 10 months ago
Improving the quality of ring oscillator PUFs on FPGAs
Physical Unclonable Functions (PUFs) based on Ring Oscillators (ROs) are a promising primitive for FPGA security. However, the quality of their implementation depends on several d...
Dominik Merli, Frederic Stumpf, Claudia Eckert