292 search results - page 51 / 59 » Are Stable Instances Easy |
83
Voted
COR
2007
15 years 21 days ago
2007
Minimizing Waiting Time Variance (WTV) is a job scheduling problem where we schedule a batch of n jobs, for servicing on a single resource, in such a way that the variance of thei...
120
click to vote
JACM
2007
15 years 18 days ago
2007
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
118
Voted
JSYML
2007
15 years 18 days ago
2007
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
96
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
91
Voted
TMC
2010
14 years 11 months ago
2010
Abstract—Link estimation is a basic element of routing in lowpower wireless networks, and data-driven link estimation using unicast MAC feedback has been shown to outperform broa...