Browsing by Subject "Complexity"
Now showing items 1-10 of 10
-
Article
Asynchronous gossip
(2013)We study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. We show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. ...
-
Article
The complexity of equilibria for risk-modeling valuations
(2016)Following the direction pioneered by Fiat and Papadimitriou in their 2010 paper [12], we study the complexity of deciding the existence of mixed equilibria for minimization games where players use valuations other than ...
-
Article
Cooperative computing with fragmentable and mergeable groups
(2003)This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P ≤ N). The processors use a group communication service (GCS) to coordinate their activity in the setting ...
-
Conference Object
E-commerce engineering: A short vs long software process for the development of e-commerce applications
(Escola Superior de Tecnologia do Instituto Politecnico de Setubal, 2003)The immediacy in developing e-commerce applications, the quality of the services offered by these systems band the need for continuous evolution are primary issues that must be fully analysed and understood prior and during ...
-
Conference Object
Estimating cognitive overload in mobile applications for decision support within the medical domain
(2012)Mobile applications have the potential to improve the quality of care received by patients from their primary care physicians (PCP). They can allow doctors to access the information they need when and where they need it ...
-
Article
From colloidal aggregates to layered nanosized structures in polymer-surfactant systems. 1. Basic phenomena
(2001)In this work, we examine the rich crystallization behavior that occurs in PbII/S-II/poly(ethylene oxide) (PEO)/sodium dodecyl sulfate (SDS) systems, in which the anionic surfactant interacts strongly with the polymer ...
-
Article
A grid-free abstraction of the Navier-Stokes equations in Fortran 95/2003
(2008)Computational complexity theory inspires a grid-free abstraction of the Navier-Stokes equations in Fortran 95/2003. A novel complexity analysis estimates that structured programming time grows at least quadratically with ...
-
Conference Object
On the complexity of asynchronous gossip
(2008)In this paper, we study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. In short, we show that an adaptive adversary can significantly hamper the spreading of a rumor, while an ...
-
Article
Revised Test for Stochastic Diagnosability of Discrete-Event Systems
(2018)This paper provides revisions to the algorithms presented by Chen et al., 2013 for testing diagnosability of stochastic discrete-event systems. Additional new contributions include PSPACE-hardness of verifying strong ...
-
Article
A shift to randomness of brain oscillations in people with autism
(2010)Background Resting-state functional magnetic resonance imaging (fMRI) enables investigation of the intrinsic functional organization of the brain. Fractal parameters such as the Hurst exponent, H, describe the complexity ...