Sciweavers

240 search results - page 11 / 48
» On the One-Dimensional Optimal Switching Problem
Sort
View
TCOM
2008
81views more  TCOM 2008»
13 years 9 months ago
On optimal computation of MPLS label binding for multipoint-to-point connections
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of under...
Fernando Solano, Ramón Fabregat, José...
INFOCOM
2005
IEEE
14 years 3 months ago
Optical switching networks with minimum number of limited range wavelength converters
— We study the problem of determining the minimum number of limited range wavelength converters needed to construct strictly, wide-sense, and rearrangeably nonblocking optical cr...
Hung Q. Ngo, Dazhen Pan, Yuanyuan Yang
CEC
2011
IEEE
12 years 10 months ago
On universal search strategies for multi-criteria optimization using weighted sums
—We develop a stochastic local search algorithm for finding Pareto points for multi-criteria optimization problems. The algorithm alternates between different single-criterium o...
Julien Legriel, Scott Cotton, Oded Maler
ICTAI
1996
IEEE
14 years 2 months ago
Applying a Mutation-based Genetic Algorithm to Processor Configuration Problems
The Processor Configuration Problem (PCP) is a Constraint Optimization Problem. The task is to link up a finite set of processors into a network, while minimizing the maximum dist...
T. L. Lau, Edward P. K. Tsang
CPAIOR
2007
Springer
14 years 4 months ago
Solving a Stochastic Queueing Control Problem with Constraint Programming
In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic custome...
Daria Terekhov, J. Christopher Beck