144 search results - page 12 / 29 » Time-Space Tradeoffs for Satisfiability |
FMCAD
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, a new heuristic-based approach is introduced to extract minimally unsatisfiable subformulas (in short, MUSes) of SAT instances. It is shown that it often outperforms...
HICSS
2006
IEEE
14 years 1 months ago
2006
IEEE
The resource decisions in software project using cost models do not satisfy managerial decision, as it does not support trade-off analysis among resources. A Bayesian net approach...
POPL
1995
ACM
13 years 11 months ago
1995
ACM
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...
INFOCOM
1994
IEEE
13 years 11 months ago
1994
IEEE
This paper is motivated by the need to support multiple service classes in fast packet-switched networks. We address the problem of characterizing and designing scheduling policie...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— Achieving minimal loss while satisfying an acceptable delay profile remains to be an open problem under the RED queuing discipline. In this paper, we present a framewo...