1007 search results - page 156 / 202 » The Complexity of Futile Questioning |
119
Voted
CIIA
2009
15 years 1 months ago
2009
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...
116
Voted
DEXA
2010
Springer
15 years 1 months ago
2010
Springer
With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexi...
124
Voted
GRC
2008
IEEE
15 years 1 months ago
2008
IEEE
—Secure multiparty computation is a very important research topic in cryptography. A secure multi-party computation involves N untrusful parties. It takes input xi from the ith p...
85
Voted
AHSWN
2007
15 years 24 days ago
2007
— We show that simple radio propagation and node mobility models widely used in MANET evaluation are not robust in indoor environments. Robust simulation models let researchers e...
99
Voted
AIS
2010
Springer
15 years 24 days ago
2010
Springer
If complexity is a necessary but not sufficient premise for the existence and expression of the living, anticipation is the distinguishing characteristic of what is alive. Anticipa...