Abstract. Semantic tools such as triple stores, reasoners and query engines tend to be designed for large-scale applications. However, with the rise of sensor networks, smart-phone...
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide abo...
Abstract. One of the most challenging applications of wireless networking are in disaster area networks where lack of infrastructure, limited energy resources, need for common oper...
Jordi Cucurull, Mikael Asplund, Simin Nadjm-Tehran...
—The behavior of complex production automation systems is hard to predict, therefore simulation is used to study the likely system behavior. However, in a real-world system many ...
Storage systems in emerging large-scale (a.k.a. peta-scale) computing systems often introduce a performance or scalability bottleneck. To deal with these limitations we propose a ...
Samer Al-Kiswany, Abdullah Gharaibeh, Matei Ripean...