Sciweavers

16091 search results - page 92 / 3219
» Solving
Sort
View
COR
2008
88views more  COR 2008»
13 years 7 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...
ENDM
2010
141views more  ENDM 2010»
13 years 7 months ago
Solving Replica Placement and Request Distribution in Content Distribution Networks
A Content Distribution Network (CDN) is an overlay network where servers replicate contents and distribute client's requests with the aim at reducing delay, server load and n...
Tiago Araújo Neves, Lúcia Maria de A...
EOR
2010
110views more  EOR 2010»
13 years 7 months ago
A hybrid metaheuristic approach to solving the UBQP problem
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
Zhipeng Lü, Fred Glover, Jin-Kao Hao
IJON
2008
177views more  IJON 2008»
13 years 7 months ago
An asynchronous recurrent linear threshold network approach to solving the traveling salesman problem
In this paper, an approach to solving the classical Traveling Salesman Problem (TSP) using a recurrent network of linear threshold (LT) neurons is proposed. It maps the classical ...
Eu Jin Teoh, Kay Chen Tan, H. J. Tang, Cheng Xiang...
IJMC
2006
84views more  IJMC 2006»
13 years 7 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan