Sciweavers

43 search results - page 7 / 9
» On the Fundamental Tautology of Validating Data-Driven Model...
Sort
View
MICRO
2002
IEEE
124views Hardware» more  MICRO 2002»
14 years 15 days ago
Optimizing pipelines for power and performance
During the concept phase and definition of next generation high-end processors, power and performance will need to be weighted appropriately to deliver competitive cost/performan...
Viji Srinivasan, David Brooks, Michael Gschwind, P...
TDSC
2010
157views more  TDSC 2010»
13 years 2 months ago
On the Survivability of Wireless Ad Hoc Networks with Node Misbehaviors and Failures
Network survivability is the ability of a network keeping connected under failures and attacks, which is a fundamental issue to the design and performance evaluation of wireless ad...
Fei Xing, Wenye Wang
TIT
2010
146views Education» more  TIT 2010»
13 years 2 months ago
Information propagation speed in mobile and delay tolerant networks
Abstract--The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop pat...
Philippe Jacquet, Bernard Mans, Georgios Rodolakis
COMPSAC
2010
IEEE
13 years 5 months ago
Behavior Monitoring in Self-Healing Service-Oriented Systems
Web services and service-oriented architecture (SOA) have become the de facto standard for designing distributed and loosely coupled applications. Many servicebased applications de...
Harald Psaier, Florian Skopik, Daniel Schall, Scha...
JCST
2010
189views more  JCST 2010»
13 years 2 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar