2520 search results - page 226 / 504 » The complexity of approximating entropy |
158
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested agents. Specifically, we consider the case where issues are divisible, there are time constraints in ...
180
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
177
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
148
click to vote
SIAMJO
2010
15 years 1 months ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
172
click to vote
GECCO
2007
Springer
16 years 22 days ago
2007
Springer
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...