1331 search results - page 198 / 267 » Complexity bounds for zero-test algorithms |
168
click to vote
ADHOCNOW
2008
Springer
16 years 16 days ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
140
click to vote
ATAL
2007
Springer
16 years 11 days ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
156
click to vote
ATAL
2007
Springer
16 years 11 days ago
2007
Springer
In an election held in a noisy environment, agents may unintentionally perturb the outcome by communicating faulty preferences. We investigate this setting by introducing a theore...
152
click to vote
SIAMJO
2008
15 years 6 months ago
2008
We study the second-order feasibility cone F = {y IRn : My gT y} for given data (M, g). We construct a new representation for this cone and its dual based on the spectral decompo...
168
click to vote
COMCOM
2004
15 years 6 months ago
2004
This article proposes the XGOP-B deterministic traffic model for MPEG video services requiring strict bounds on the quality of service provided by the network. The XGOP-B model ta...