2084 search results - page 161 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
131
click to vote
FSTTCS
2004
Springer
15 years 10 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
133
Voted
DCFS
2011
14 years 4 months ago
2011
We prove Kleene theorems for two subclasses of labelled product systems which are inspired from well-studied subclasses of 1bounded Petri nets. For product T-systems we define a c...
179
Voted
COLT
1998
Springer
15 years 9 months ago
1998
Springer
A new algorithm for learning one-variable pattern languages is proposed and analyzed with respect to its average-case behavior. We consider the total learning time that takes into...
148
Voted
JAIR
2007
15 years 4 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
156
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— We consider the problem of throughput-optimal cross-layer design of wireless networks. We propose a joint congestion control and scheduling algorithm that achieves a fraction d...