Sciweavers

4679 search results - page 315 / 936
» Modeling When Connections Are the Problem
Sort
View
FTRTFT
1998
Springer
15 years 11 months ago
Predictability in Critical Systems
Predictability is crucial in critical applications and systems. Therefore, we examine sources of uncertainty for each of the four phases that span a project lifecycle, from initial...
Gérard Le Lann
ICFEM
2009
Springer
15 years 4 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
188
Voted
PKAW
2010
15 years 5 months ago
Finding Relation between PageRank and Voter Model
Abstract. Estimating influence of a node is an important problem in social network analyses. We address this problem in a particular class of model for opinion propagation in whic...
Takayasu Fushimi, Kazumi Saito, Masahiro Kimura, H...
GLOBECOM
2006
IEEE
16 years 21 days ago
Modelling the Impact of User Mobility on the Throughput in Networks of Wireless 802.11 LANs
— The wireless LAN technology 802.11, also called Wi-Fi, offers high speed wireless Internet access for local area environments. WLANs provide much higher data rates than the mob...
Sandjai Bhulai, Robert D. van der Mei, Taoying Yua...
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
13 years 9 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang