2084 search results - page 170 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
140
click to vote
DAC
1999
ACM
16 years 6 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
141
Voted
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
—We consider a widely applicable model of resource allocation where two sequences of events are coupled: on a continuous time axis (t), network dynamics evolve over time. On a di...
148
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
—Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees ar...
185
click to vote
AAIM
2007
Springer
15 years 11 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
157
Voted
COLT
2001
Springer
15 years 9 months ago
2001
Springer
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...