1554 search results - page 220 / 311 » Parameterized Complexity and Approximation Algorithms |
152
click to vote
DIALM
2005
ACM
15 years 5 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
135
click to vote
SIGECOM
2003
ACM
15 years 8 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
142
click to vote
MOBIHOC
2010
ACM
15 years 1 months ago
2010
ACM
Passive monitoring utilizing distributed wireless sniffers is an effective technique to monitor activities in wireless infrastructure networks for fault diagnosis, resource manage...
121
click to vote
ICCV
2003
IEEE
16 years 5 months ago
2003
IEEE
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
136
click to vote
MFCS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...