698 search results - page 13 / 140 » A Deterministic Algorithm for Solving Imprecise Decision Pro... |
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
133
click to vote
ECCC
2011
14 years 3 months ago
2011
The existence of optimal algorithms is not known for any decision problem in NP \ P. We consider the problem of testing the membership in the image of an injective function. We co...
ICDCN
2010
Springer
15 years 6 months ago
2010
Springer
The paper considers the consensus problem in a partially synchronous system with Byzantine faults. It turns out that, in the partially synchronous system, all deterministic algorit...
CIE
2008
Springer
15 years 1 months ago
2008
Springer
We revisit the deterministic graphical games of Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we ...
115
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...