Sciweavers

2738 search results - page 70 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
HM
2007
Springer
114views Optimization» more  HM 2007»
14 years 1 months ago
Hybrid Numerical Optimization for Combinatorial Network Problems
Abstract. We discuss a general approach to hybridize traditional construction heuristics for combinatorial optimization problems with numerical based evolutionary algorithms. There...
Markus Chimani, Maria Kandyba, Mike Preuss
AICCSA
2005
IEEE
104views Hardware» more  AICCSA 2005»
14 years 3 months ago
Multicast address management in the Internet: a study of the port blocking problem
A critical issue in multicast communication is how to identify multicast groups. In the Internet, multicast addresses and port numbers distinguish multicast groups from each other...
Emad Eldin Mohamed, Hussein M. Abdel-Wahab, I. Sal...
ICALP
2001
Springer
14 years 2 months ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
ACSC
2008
IEEE
14 years 2 days ago
An investigation of the state formation and transition limitations for prediction problems in recurrent neural networks
Recurrent neural networks are able to store information about previous as well as current inputs. This "memory" allows them to solve temporal problems such as language r...
Angel Kennedy, Cara MacNish
CEC
2010
IEEE
13 years 10 months ago
Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem
— Capacitated arc routing problem (CARP) has attracted much attention due to its generality to many real world problems. Memetic algorithm (MA), among other metaheuristic search ...
Liang Feng, Yew-Soon Ong, Quang Huy Nguyen 0001, A...