Sciweavers

1662 search results - page 265 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
SPIN
2012
Springer
11 years 11 months ago
Counterexample Explanation by Anomaly Detection
Since counterexamples generated by model checking tools are only symptoms of faults in the model, a significant amount of manual work is required in order to locate the fault that...
Stefan Leue, Mitra Tabaei Befrouei
WISEC
2010
ACM
14 years 3 months ago
On the reliability of wireless fingerprinting using clock skews
Determining whether a client station should trust an access point is a known problem in wireless security. Traditional approaches to solving this problem resort to cryptography. B...
Chrisil Arackaparambil, Sergey Bratus, Anna Shubin...
AUTONOMICS
2009
ACM
14 years 3 months ago
Sensor Selection for IT Infrastructure Monitoring
Supervisory control is the main means to assure a high level performance and availability of large IT infrastructures. Applied control theory is used in physical and virtualization...
Gergely János Paljak, Imre Kocsis, Zolt&aac...
DCOSS
2005
Springer
14 years 2 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie
SEAAI
1998
Springer
14 years 29 days ago
On theoretical backgrounds of CAD
Abstract. In the past, some information technologies (IT) have quickly been adopted by the engineering practice while the implementation of others has been slower. In the paper, th...
Ziga Turk