1429 search results - page 139 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
REALWSN
2010
13 years 3 months ago
2010
Pre-deployment tests of sensor networks in indoor testbeds can only deliver a very approximate view of the correctness and performance of a deployed sensor network and it is theref...
IPPS
2010
IEEE
13 years 7 months ago
2010
IEEE
We consider the problem of broadcasting a large message in a large scale distributed platform. The message must be sent from a source node, with the help of the receiving peers whi...
SIGECOM
2008
ACM
13 years 9 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...
COMPGEOM
2005
ACM
13 years 11 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
GECCO
2008
Springer
13 years 10 months ago
2008
Springer
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...