Sciweavers

2862 search results - page 28 / 573
» Bicriteria Network Design Problems
Sort
View
NETWORKS
2007
13 years 9 months ago
Survivable IP network design with OSPF routing
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc w...
Luciana S. Buriol, Mauricio G. C. Resende, Mikkel ...
HASE
2007
IEEE
14 years 4 months ago
Design of a Fairness Guarantee Mechanism Based on Network Measurement
In this paper we discuss the problem of network fairness. Traditional network fairness focuses on treating uneven resource (such as bandwidth) allocation in TCP congestion control...
Xin Wang, Xiaochen Zhang, Shuang Yang, Xiangyang X...
ICCS
2007
Springer
14 years 3 months ago
An Heuristic Method for GPS Surveying Problem
Abstract. This paper describes metaheuristic algorithm based on simulated annealing method,which is a nature-inspired method, to analyze and improve the efficiency of the design of...
Stefka Fidanova
EVOW
2001
Springer
14 years 2 months ago
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem
Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in network design. We consider the problem of augmenting...
Ivana Ljubic, Günther R. Raidl
TASE
2012
IEEE
12 years 5 months ago
Discrete-Event Coordination Design for Distributed Agents
— This paper presents new results on the formal design of distributed coordinating agents in a discrete-event framework. In this framework, agents are modeled to be individually ...
Manh Tung Pham, Kiam Tian Seow