1424 search results - page 59 / 285 » The Multi-radius Cover Problem |
111
Voted
SIAMJO
2010
14 years 9 months ago
2010
We present a new family of proximal point methods for solving monotone variational inequalities. Our algorithm has a relative error tolerance criterion in solving the proximal subp...
112
Voted
MOR
2002
15 years 2 months ago
2002
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...
130
Voted
FSTTCS
2010
Springer
15 years 19 days ago
2010
Springer
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...
120
Voted
AAAI
2008
15 years 5 months ago
2008
The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginal...
141
Voted
AMAI
2000
Springer
15 years 6 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...