Sciweavers

170 search results - page 28 / 34
» On computational properties of chains of recurrences
Sort
View
MOBIHOC
2010
ACM
13 years 5 months ago
Globs in the primordial soup: the emergence of connected crowds in mobile wireless networks
In many practical scenarios, nodes gathering at points of interest yield sizable connected components (clusters), which sometimes comprise the majority of nodes. While recent anal...
Simon Heimlicher, Kavé Salamatian
FOCS
2008
IEEE
14 years 1 months ago
Mixing Time of Exponential Random Graphs
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
Shankar Bhamidi, Guy Bresler, Allan Sly
CBSE
2011
Springer
12 years 7 months ago
Rectifying orphan components using group-failover in distributed real-time and embedded systems
Orphan requests are a significant problem for multi-tier distributed systems since they adversely impact system correctness by violating the exactly-once semantics of application...
Sumant Tambe, Aniruddha S. Gokhale
APAL
2010
115views more  APAL 2010»
13 years 7 months ago
Kripke semantics for provability logic GLP
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
Lev D. Beklemishev
ANOR
2008
69views more  ANOR 2008»
13 years 7 months ago
Scheduling vessels and container-yard operations with conflicting objectives
Abstract We consider the problem of coordinating the operations of two supply chain partners: a foreign shipping company and a domestic port. The two partners have conflicting busi...
Endre Boros, Lei Lei, Yao Zhao, Hua Zhong