65 search results - page 2 / 13 » An Error Bound Based on a Worst Likely Assignment |
WADS
2007
Springer
13 years 11 months ago
2007
Springer
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—Localization in the presence of malicious beacon nodes is an important problem in wireless networks. Although significant progress has been made on this problem, some fundament...
TABLEAUX
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
JC
2007
13 years 4 months ago
2007
We study the optimal approximation of the solution of an operator equation A(u) = f by certain n-term approximations with respect to specific classes of frames. We consider worst...