Sciweavers

2862 search results - page 16 / 573
» Bicriteria Network Design Problems
Sort
View
ADHOCNOW
2008
Springer
14 years 1 months ago
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
Michael Elkin, Yuval Lando, Zeev Nutov, Michael Se...
GECCO
2008
Springer
127views Optimization» more  GECCO 2008»
13 years 8 months ago
Metaheuristics for solving a real-world frequency assignment problem in GSM networks
The Frequency Assignment Problem (FAP) is one of the key issues in the design of GSM networks (Global System for Mobile communications), and will remain important in the foreseeab...
Francisco Luna, César Estébanez, Cor...
KES
2007
Springer
14 years 1 months ago
Design of Neural Networks
The paper offers a critical analysis of the procedure observed in many applications of neural networks. Given a problem to be solved, a favorite NN-architecture is chosen and its p...
Claudio Moraga
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
13 years 9 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen
GECCO
2007
Springer
144views Optimization» more  GECCO 2007»
13 years 11 months ago
Multiobjective network design for realistic traffic models
Network topology design problems find application in several real life scenarios. However, most designs in the past either optimize for a single criterion like delay or assume sim...
Nilanjan Banerjee, Rajeev Kumar