1222 search results - page 62 / 245 » corr 2008 |
206
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study the scheduling problem on unrelated machines in the mechanism design setting. This problem was proposed and studied in the seminal paper of Nisan and
138
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The tendency of semidefinite programs to compose perfectly under product has been exploited many times in complexity theory: for example, by Lov
141
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
147
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In order to better understand reasoning involved in analyzing infinite games in extensive form, we performed the experiments in proof assistant Coq that are reported here.
153
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract-- An outer bound to the discrete memoryless broadcast channel is presented. We compare it to the known outer bounds and show that the outer bound presented is at least as ...