1208 search results - page 15 / 242 » Uniform eventown problems |
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
A recurring theme in the literature on derandomization is that probabilistic algorithms can be simulated quickly by deterministic algorithms, if one can obtain impressive (i.e., s...
ACL
2010
14 years 9 months ago
2010
We consider the search for a maximum likelihood assignment of hidden derivations and grammar weights for a probabilistic context-free grammar, the problem approximately solved by ...
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
111
click to vote
ECRTS
2005
IEEE
15 years 5 months ago
2005
IEEE
The partitioning of periodic task systems upon uniform multiprocessors is considered. In the partitioned approach to scheduling periodic tasks upon multiprocessors, each task is a...
IPPS
2007
IEEE
15 years 5 months ago
2007
IEEE
This paper focuses on peer-to-peer storage systems that achieve availability through replication. We study the problem of resource allocation when the system must replicate multip...