817 search results - page 34 / 164 » Exact solutions to linear programming problems |
IJCAI
1989
13 years 10 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
FOCS
1990
IEEE
14 years 25 days ago
1990
IEEE
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
FUIN
2010
13 years 7 months ago
2010
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
CASES
2006
ACM
14 years 2 months ago
2006
ACM
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...