427 search results - page 26 / 86 » A Subexponential Bound for Linear Programming |
CAV
2003
Springer
14 years 27 days ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
AAAI
2006
13 years 9 months ago
2006
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
JCO
1998
13 years 7 months ago
1998
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...
AAMAS
2011
Springer
13 years 2 months ago
2011
Springer
How does one repeatedly choose actions so as to be fairest to the multiple beneficiaries of those actions? We examine approaches to discovering sequences of actions for which the...
IJCAI
1989
13 years 8 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...