2168 search results - page 81 / 434 » Randomized Algorithms and Complexity Theory |
121
click to vote
WG
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
134
click to vote
ATAL
2006
Springer
15 years 6 months ago
2006
Springer
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...
172
click to vote
SIAMCOMP
2011
14 years 10 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
124
click to vote
ECOOP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired s...
VTC
2008
IEEE
15 years 9 months ago
2008
IEEE
—In this paper, low complexity acquisition of UWB telemetry data packets is addressed. In addition to the usual channel impairments considered of additive white Gaussian noise (A...