261 search results - page 32 / 53 » A randomized polynomial-time simplex algorithm for linear pr... |
133
click to vote
CCCG
2009
15 years 2 months ago
2009
Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
104
click to vote
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
102
click to vote
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
Security in multiagent systems is commonly defined as the ability of the system to deal with intentional threats from other agents. This paper focuses on domains where such intent...
119
click to vote
ANOR
2004
15 years 1 months ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
125
Voted
COMPGEOM
1998
ACM
15 years 6 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...