2084 search results - page 137 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
133
click to vote
FSTTCS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We provide a framework for distributed systems that impose timing constraints on their executions. We propose a timed model of communicating finite-state machines, which...
147
click to vote
CPC
2006
15 years 5 months ago
2006
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
142
Voted
BIOWIRE
2007
Springer
15 years 11 months ago
2007
Springer
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. In particular, r...
145
click to vote
RTAS
2010
IEEE
15 years 3 months ago
2010
IEEE
Prior work has shown that the global earliest-deadline-first (GEDF) scheduling algorithm ensures bounded deadline tardiness on multiprocessors with no utilization loss; therefore...
139
click to vote
TCS
2008
15 years 4 months ago
2008
Formalized study of self-assembly has led to the definition of the tile assembly model, Previously I presented ways to compute arithmetic functions, such as addition and multiplic...