Sciweavers

16404 search results - page 488 / 3281
» A set coverage problem
Sort
View
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
15 years 5 months ago
On random walks in direction-aware network problems
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
Ali Tizghadam, Alberto Leon-Garcia
SIAMJO
2011
15 years 1 months ago
Prox-Penalization and Splitting Methods for Constrained Variational Problems
This paper is concerned with the study of a class of prox-penalization methods for solving variational inequalities of the form Ax + NC (x) 0 where H is a real Hilbert space, A : H...
Hedy Attouch, Marc-Olivier Czarnecki, Juan Peypouq...
TIT
2011
106views more  TIT 2011»
15 years 1 months ago
Concavity of the Feasible Signal-to-Noise Ratio Region in Power Control Problems
Signal-to-noise (SNR) ratio is commonly regarded as a reliable measure of the performance of wireless communication systems. Knowledge of the fundamental properties of the feasibl...
Wing Shing Wong
JUCS
2010
117views more  JUCS 2010»
15 years 5 months ago
NP-completeness and FPT Results for Rectilinear Covering Problems
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
Vladimir Estivill-Castro, Apichat Heednacram, Fran...
TAMC
2007
Springer
16 years 29 days ago
Kernelizations for Parameterized Counting Problems
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley