1941 search results - page 33 / 389 » On the Hardness of Approximate Reasoning |
ECCC
2006
14 years 11 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
JACM
2006
14 years 11 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
For economic reasons, a new trend in the development of distributed hard real-time systems is to rely on the use of CommercialO -The-Shelf cots hardware and operating systems. As...
124
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
115
click to vote
RTCSA
1999
IEEE
15 years 4 months ago
1999
IEEE
Java's automatic memory management is the main reason that prevents Java from being used in hard realtime environments. We present the garbage collection mechanism that is us...