Sciweavers

570 search results - page 69 / 114
» Robustness and Implementability of Timed Automata
Sort
View
CONCUR
2010
Springer
14 years 2 days ago
Simulation Distances
Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by realvalued distance functions between systems, wher...
Pavol Cerný, Thomas A. Henzinger, Arjun Rad...
INFOCOM
2012
IEEE
12 years 1 months ago
ADAM: An adaptive beamforming system for multicasting in wireless LANs
—We present the design and implementation of ADAM, the first adaptive beamforming based multicast system and experimental framework for indoor wireless environments. ADAM addres...
Ehsan Aryafar, Mohammad Ali Khojastepour, Karthike...
ACCV
2006
Springer
14 years 5 months ago
Boosted Algorithms for Visual Object Detection on Graphics Processing Units
Nowadays, the use of machine learning methods for visual object detection has become widespread. Those methods are robust. They require an important processing power and a high mem...
Hicham Ghorayeb, Bruno Steux, Claude Laurgeau
ICSEA
2008
IEEE
14 years 5 months ago
Reuse through Requirements Traceability
The Reuse of code artefacts can make development quicker, cheaper and more robust, but the process is complex and has many pitfalls: Code artefacts must exist, be available, be fo...
Rob Pooley, Craig Warren
IPPS
2009
IEEE
14 years 5 months ago
Crash fault detection in celerating environments
Failure detectors are a service that provides (approximate) information about process crashes in a distributed system. The well-known “eventually perfect” failure detector, 3P...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch