1331 search results - page 84 / 267 » Complexity bounds for zero-test algorithms |
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
IJAR
2006
14 years 9 months ago
2006
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
89
Voted
ATAL
2006
Springer
15 years 1 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...
SIGSOFT
2007
ACM
15 years 10 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
73
Voted
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...