3049 search results - page 591 / 610 » On the Convergence of Bound Optimization Algorithms |
120
click to vote
CORR
2010
Springer
15 years 13 days ago
2010
Springer
: We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization. For ...
116
click to vote
TECS
2010
15 years 7 days ago
2010
We consider the problem of recovering from failures of distributable threads (“threads”) in distributed realtime systems that operate under run-time uncertainties including th...
133
click to vote
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
127
Voted
MOBIHOC
2005
ACM
16 years 1 months ago
2005
ACM
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
127
click to vote
ICS
2007
Tsinghua U.
15 years 8 months ago
2007
Tsinghua U.
This paper presents Cooperative Cache Partitioning (CCP) to allocate cache resources among threads concurrently running on CMPs. Unlike cache partitioning schemes that use a singl...