11740 search results - page 99 / 2348 » More Problems in Rewriting |
98
Voted
COCO
1998
Springer
15 years 5 months ago
1998
Springer
We show that the satisfiability problem for bounded-error probabilistic ordered branching programs is NP-complete. If the error is very small, however (more precisely, if the erro...
99
Voted
COR
2004
15 years 17 days ago
2004
We collected and analyzed a number of linear programming problems that have been shown to cycle (not converge) when solved by Dantzig's original simplex algorithm. For these ...
100
Voted
ACSC
2006
IEEE
15 years 6 months ago
2006
IEEE
In the current state of the rapid growth of information resources and the huge number of requests submitted by users to existing information retrieval systems; recently, Question ...
CSFW
2010
IEEE
15 years 4 months ago
2010
IEEE
—This paper seeks to answer fundamental questions about trade-offs between static and dynamic security analysis. It has been previously shown that flow-sensitive static informat...
111
Voted
ESORICS
2000
Springer
15 years 4 months ago
2000
Springer
Several authors have proposed using code modification as a technique for enforcing security policies such as resource limits, access controls, and network information flows. Howeve...