909 search results - page 80 / 182 » On the approximability of some network design problems |
137
click to vote
ATAL
2007
Springer
16 years 12 days ago
2007
Springer
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. W...
208
click to vote
IJCNN
2007
IEEE
16 years 16 days ago
2007
IEEE
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
173
click to vote
SNPD
2007
15 years 7 months ago
2007
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...
153
click to vote
ICNP
2009
IEEE
15 years 4 months ago
2009
IEEE
Deploying city-wide 802.11 access points has made possible internet access in a vehicle, nevertheless it is challenging to maintain client performance at vehicular speed especially...
162
click to vote
PODC
2006
ACM
16 years 5 days ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...