A new combinational logic minimization technique with applications to cryptology
A new technique for combinational logic optimization is described. The technique is a two-
step process. In the first step, the non-linearity of a circuit–as measured by the number of …
step process. In the first step, the non-linearity of a circuit–as measured by the number of …
Evolutionary multiobjective optimization for base station transmitter placement with frequency assignment
N Weicker, G Szabo, K Weicker… - IEEE transactions on …, 2003 - ieeexplore.ieee.org
We propose a new solution to the problem of positioning base station transmitters of a
mobile phone network and assigning frequencies to the transmitters, both in an optimal way …
mobile phone network and assigning frequencies to the transmitters, both in an optimal way …
An efficient stochastic gradient descent algorithm to maximize the coverage of cellular networks
Network coverage and capacity optimization is an important operational task in cellular
networks. The network coverage maximization by adjusting azimuths and tilts of antennas is …
networks. The network coverage maximization by adjusting azimuths and tilts of antennas is …
Cost effective deployment strategies for heterogenous wireless networks
K Johansson - 2007 - diva-portal.org
Wireless access to the Internet is expected to be very valuable for both individuals and the
society. However, advances in transmission technology alone may not be sufficient to …
society. However, advances in transmission technology alone may not be sufficient to …
Polynomial time approximation schemes for base station coverage with minimum total radii
N Lev-Tov, D Peleg - Computer Networks, 2005 - Elsevier
This paper concerns a geometric disk problem motivated by base station placement issues
arising in wireless network design. The problem requires covering a given set of clients by a …
arising in wireless network design. The problem requires covering a given set of clients by a …
Optimal base station positioning and channel assignment for 3G mobile networks by integer programming
R Mathar, M Schmeink - Annals of Operations Research, 2001 - Springer
In this paper, discrete mathematical programming approaches are used to solve the
frequency allocation and cell site selection problem in an integrated setup. Both CDMA …
frequency allocation and cell site selection problem in an integrated setup. Both CDMA …
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
J Alber, J Fiala - Journal of Algorithms, 2004 - Elsevier
We consider the parameterized problem, whether for a given set D of n disks (of bounded
radius ratio) in the Euclidean plane there exists a set of k non-intersecting disks. For this …
radius ratio) in the Euclidean plane there exists a set of k non-intersecting disks. For this …
A polynomial-time approximation scheme for base station positioning in UMTS networks
We consider the following optimization problem for UMTS networks: For a specified
teletraffic demand and possible base station locations, choose positions for base stations …
teletraffic demand and possible base station locations, choose positions for base stations …
[PDF][PDF] Approximating geometric coverage problems
T Erlebach, EJ van Leeuwen - … of the nineteenth annual ACM-SIAM …, 2008 - cs.haifa.ac.il
We present the first study on the approximability of geometric versions of the unique
coverage problem and the minimum membership set cover problem. In the former problem …
coverage problem and the minimum membership set cover problem. In the former problem …
A coral reefs optimization algorithm for optimal mobile network deployment with electromagnetic pollution control criterion
S Salcedo-Sanz, P García-Díaz… - Applied Soft …, 2014 - Elsevier
In this paper we apply a novel meta-heuristic approach, the Coral Reefs Optimization (CRO)
algorithm, to solve a Mobile Network Deployment Problem (MNDP), in which the control of …
algorithm, to solve a Mobile Network Deployment Problem (MNDP), in which the control of …